./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 ................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 65a8838494b0fa2a560742eb829642f08a5d8cc8 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-6b5699a [2019-11-26 02:44:11,590 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:44:11,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:44:11,603 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:44:11,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:44:11,605 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:44:11,607 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:44:11,609 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:44:11,611 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:44:11,612 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:44:11,613 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:44:11,614 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:44:11,614 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:44:11,616 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:44:11,617 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:44:11,618 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:44:11,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:44:11,620 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:44:11,622 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:44:11,624 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:44:11,626 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:44:11,627 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:44:11,628 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:44:11,629 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:44:11,632 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:44:11,633 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:44:11,633 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:44:11,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:44:11,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:44:11,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:44:11,636 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:44:11,637 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:44:11,637 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:44:11,638 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:44:11,639 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:44:11,640 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:44:11,640 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:44:11,641 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:44:11,641 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:44:11,642 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:44:11,643 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:44:11,644 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-11-26 02:44:11,659 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:44:11,660 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:44:11,660 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:44:11,661 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:44:11,661 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:44:11,661 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:44:11,661 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-11-26 02:44:11,662 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:44:11,662 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:44:11,662 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-11-26 02:44:11,662 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-11-26 02:44:11,663 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:44:11,663 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-11-26 02:44:11,663 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-11-26 02:44:11,664 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-11-26 02:44:11,664 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:44:11,665 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:44:11,665 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-26 02:44:11,665 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:44:11,665 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:44:11,666 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:44:11,666 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:44:11,666 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:44:11,666 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:44:11,667 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:44:11,668 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:44:11,668 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:44:11,668 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:44:11,669 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:44:11,669 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:44:11,669 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:44:11,670 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:44:11,670 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:44:11,670 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-11-26 02:44:11,670 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-26 02:44:11,671 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:44:11,671 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:44:11,671 INFO L138 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/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-26 02:44:11,827 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:44:11,837 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:44:11,842 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:44:11,844 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:44:11,844 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:44:11,845 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-26 02:44:11,900 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/d1ec65a5f/50949bab9e344056891fc7af40dd2502/FLAG248898f7b [2019-11-26 02:44:12,280 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:44:12,281 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-26 02:44:12,287 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/d1ec65a5f/50949bab9e344056891fc7af40dd2502/FLAG248898f7b [2019-11-26 02:44:12,702 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/d1ec65a5f/50949bab9e344056891fc7af40dd2502 [2019-11-26 02:44:12,704 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:44:12,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:44:12,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:12,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:44:12,711 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:44:12,712 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:12" (1/1) ... [2019-11-26 02:44:12,715 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a13479b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:12, skipping insertion in model container [2019-11-26 02:44:12,715 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:12" (1/1) ... [2019-11-26 02:44:12,723 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:44:12,745 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:44:12,913 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:12,916 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:44:13,005 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:13,026 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:44:13,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13 WrapperNode [2019-11-26 02:44:13,027 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:13,027 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:13,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:44:13,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:44:13,036 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:13,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:44:13,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:44:13,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:44:13,093 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,108 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,109 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,117 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,135 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,138 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... [2019-11-26 02:44:13,152 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:44:13,153 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:44:13,153 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:44:13,153 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:44:13,154 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:13,226 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:44:13,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-26 02:44:13,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:44:13,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:44:13,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-26 02:44:13,229 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:44:14,056 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:44:14,056 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-26 02:44:14,057 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:14 BoogieIcfgContainer [2019-11-26 02:44:14,058 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:44:14,058 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:44:14,059 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:44:14,061 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:44:14,072 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:44:12" (1/3) ... [2019-11-26 02:44:14,072 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e3142c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:14, skipping insertion in model container [2019-11-26 02:44:14,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:13" (2/3) ... [2019-11-26 02:44:14,073 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77e3142c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:14, skipping insertion in model container [2019-11-26 02:44:14,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:14" (3/3) ... [2019-11-26 02:44:14,075 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-26 02:44:14,087 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:44:14,098 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-26 02:44:14,110 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-26 02:44:14,135 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:44:14,136 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:44:14,136 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:44:14,136 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:44:14,137 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:44:14,137 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:44:14,137 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:44:14,137 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:44:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2019-11-26 02:44:14,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-11-26 02:44:14,162 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:14,163 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:14,164 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:14,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2096173776, now seen corresponding path program 1 times [2019-11-26 02:44:14,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:14,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071315993] [2019-11-26 02:44:14,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:14,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:14,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:14,317 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071315993] [2019-11-26 02:44:14,318 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:14,318 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-26 02:44:14,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203503223] [2019-11-26 02:44:14,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:44:14,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-11-26 02:44:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:44:14,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:44:14,339 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 2 states. [2019-11-26 02:44:14,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:14,356 INFO L93 Difference]: Finished difference Result 36 states and 49 transitions. [2019-11-26 02:44:14,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:44:14,358 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-11-26 02:44:14,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:14,366 INFO L225 Difference]: With dead ends: 36 [2019-11-26 02:44:14,367 INFO L226 Difference]: Without dead ends: 16 [2019-11-26 02:44:14,369 INFO L630 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 [2019-11-26 02:44:14,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-11-26 02:44:14,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-26 02:44:14,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-26 02:44:14,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-11-26 02:44:14,400 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 8 [2019-11-26 02:44:14,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:14,401 INFO L462 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-11-26 02:44:14,401 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:44:14,401 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-11-26 02:44:14,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-11-26 02:44:14,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:14,402 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:14,402 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:14,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:14,403 INFO L82 PathProgramCache]: Analyzing trace with hash 1957547596, now seen corresponding path program 1 times [2019-11-26 02:44:14,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-11-26 02:44:14,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729980471] [2019-11-26 02:44:14,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-26 02:44:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:44:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-26 02:44:14,552 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-11-26 02:44:14,552 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-26 02:44:14,580 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:44:14 BoogieIcfgContainer [2019-11-26 02:44:14,580 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:44:14,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:44:14,581 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:44:14,581 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:44:14,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:14" (3/4) ... [2019-11-26 02:44:14,585 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-26 02:44:14,585 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:44:14,588 INFO L168 Benchmark]: Toolchain (without parser) took 1881.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 942.1 MB in the beginning and 1.0 GB in the end (delta: -94.8 MB). Peak memory consumption was 48.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:14,588 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:44:14,589 INFO L168 Benchmark]: CACSL2BoogieTranslator took 320.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:14,590 INFO L168 Benchmark]: Boogie Procedure Inliner took 50.16 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:14,591 INFO L168 Benchmark]: Boogie Preprocessor took 74.78 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:14,592 INFO L168 Benchmark]: RCFGBuilder took 904.82 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: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:14,592 INFO L168 Benchmark]: TraceAbstraction took 521.75 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:14,593 INFO L168 Benchmark]: Witness Printer took 4.75 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. [2019-11-26 02:44:14,596 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 320.22 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 942.1 MB in the beginning and 1.1 GB in the end (delta: -198.2 MB). Peak memory consumption was 21.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 50.16 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 74.78 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 904.82 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: 69.8 MB). Peak memory consumption was 69.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 521.75 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: 28.3 MB). Peak memory consumption was 28.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.75 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: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; [L71] float res = fmin_float(x, y); [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 19 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 2, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 20 SDtfs, 0 SDslu, 0 SDs, 0 SdLazy, 0 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 17 NumberOfCodeBlocks, 17 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 7 ConstructedInterpolants, 0 QuantifiedInterpolants, 49 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: 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.24-6b5699a [2019-11-26 02:44:16,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-26 02:44:16,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-26 02:44:16,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-26 02:44:16,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-26 02:44:16,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-26 02:44:16,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-26 02:44:16,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-26 02:44:16,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-26 02:44:16,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-26 02:44:16,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-26 02:44:16,647 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-26 02:44:16,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-26 02:44:16,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-26 02:44:16,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-26 02:44:16,652 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-26 02:44:16,653 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-26 02:44:16,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-26 02:44:16,657 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-26 02:44:16,661 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-26 02:44:16,664 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-26 02:44:16,668 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-26 02:44:16,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-26 02:44:16,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-26 02:44:16,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-26 02:44:16,676 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-26 02:44:16,676 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-26 02:44:16,678 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-26 02:44:16,678 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-26 02:44:16,679 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-26 02:44:16,680 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-26 02:44:16,680 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-26 02:44:16,681 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-26 02:44:16,682 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-26 02:44:16,683 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-26 02:44:16,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-26 02:44:16,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-26 02:44:16,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-26 02:44:16,685 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-26 02:44:16,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-26 02:44:16,687 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-26 02:44:16,688 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-11-26 02:44:16,715 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-26 02:44:16,717 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-26 02:44:16,719 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-11-26 02:44:16,719 INFO L138 SettingsManager]: * User list type=DISABLED [2019-11-26 02:44:16,719 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-11-26 02:44:16,720 INFO L138 SettingsManager]: * Explicit value domain=true [2019-11-26 02:44:16,720 INFO L138 SettingsManager]: * Octagon Domain=false [2019-11-26 02:44:16,720 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-11-26 02:44:16,721 INFO L138 SettingsManager]: * Interval Domain=false [2019-11-26 02:44:16,722 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-26 02:44:16,723 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-26 02:44:16,723 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-26 02:44:16,723 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-26 02:44:16,724 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-26 02:44:16,724 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-26 02:44:16,724 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-26 02:44:16,724 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-11-26 02:44:16,725 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-26 02:44:16,725 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-26 02:44:16,725 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-26 02:44:16,725 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-26 02:44:16,726 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-26 02:44:16,726 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-26 02:44:16,726 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-26 02:44:16,727 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-26 02:44:16,727 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-26 02:44:16,727 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-26 02:44:16,727 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-26 02:44:16,728 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-26 02:44:16,728 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-26 02:44:16,728 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-26 02:44:16,728 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-11-26 02:44:16,728 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-26 02:44:16,729 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-26 02:44:16,729 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-26 02:44:16,729 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-11-26 02:44:17,019 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-26 02:44:17,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-26 02:44:17,041 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-26 02:44:17,042 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-26 02:44:17,043 INFO L275 PluginConnector]: CDTParser initialized [2019-11-26 02:44:17,044 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-26 02:44:17,100 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/f04e5ca2b/fe8da42f197c4b4786f834e4d390df12/FLAGa97b3b7be [2019-11-26 02:44:17,537 INFO L306 CDTParser]: Found 1 translation units. [2019-11-26 02:44:17,538 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-26 02:44:17,544 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/f04e5ca2b/fe8da42f197c4b4786f834e4d390df12/FLAGa97b3b7be [2019-11-26 02:44:17,940 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/data/f04e5ca2b/fe8da42f197c4b4786f834e4d390df12 [2019-11-26 02:44:17,943 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-26 02:44:17,944 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-26 02:44:17,947 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:17,947 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-26 02:44:17,951 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-26 02:44:17,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:17" (1/1) ... [2019-11-26 02:44:17,960 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57616940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:17, skipping insertion in model container [2019-11-26 02:44:17,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 02:44:17" (1/1) ... [2019-11-26 02:44:17,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-26 02:44:17,989 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-26 02:44:18,239 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:18,246 INFO L201 MainTranslator]: Completed pre-run [2019-11-26 02:44:18,290 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-26 02:44:18,372 INFO L205 MainTranslator]: Completed translation [2019-11-26 02:44:18,373 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18 WrapperNode [2019-11-26 02:44:18,373 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-26 02:44:18,374 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:18,374 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-26 02:44:18,374 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-26 02:44:18,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,391 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-26 02:44:18,422 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-26 02:44:18,422 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-26 02:44:18,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-26 02:44:18,432 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,432 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,436 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,436 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,446 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,452 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... [2019-11-26 02:44:18,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-26 02:44:18,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-26 02:44:18,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-26 02:44:18,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-26 02:44:18,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-26 02:44:18,520 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-26 02:44:18,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-26 02:44:18,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-26 02:44:18,523 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-26 02:44:18,524 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-26 02:44:18,937 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-26 02:44:18,937 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-26 02:44:18,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:18 BoogieIcfgContainer [2019-11-26 02:44:18,938 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-26 02:44:18,939 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-26 02:44:18,939 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-26 02:44:18,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-26 02:44:18,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 02:44:17" (1/3) ... [2019-11-26 02:44:18,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708fa409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:18, skipping insertion in model container [2019-11-26 02:44:18,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 02:44:18" (2/3) ... [2019-11-26 02:44:18,944 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@708fa409 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 02:44:18, skipping insertion in model container [2019-11-26 02:44:18,944 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:18" (3/3) ... [2019-11-26 02:44:18,946 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-26 02:44:18,955 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-26 02:44:18,961 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-26 02:44:18,969 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-26 02:44:18,991 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-26 02:44:18,991 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-26 02:44:18,991 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-26 02:44:18,991 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-26 02:44:18,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-26 02:44:18,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-26 02:44:18,992 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-26 02:44:18,992 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-26 02:44:19,007 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-26 02:44:19,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-26 02:44:19,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:19,014 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:19,015 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:19,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:19,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-26 02:44:19,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:19,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065510353] [2019-11-26 02:44:19,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:19,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:19,132 INFO L255 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-26 02:44:19,137 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:19,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:19,152 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:19,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:19,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065510353] [2019-11-26 02:44:19,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:19,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-26 02:44:19,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184243043] [2019-11-26 02:44:19,165 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-26 02:44:19,165 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:19,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-26 02:44:19,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:44:19,180 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-26 02:44:19,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:19,200 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-26 02:44:19,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-26 02:44:19,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-26 02:44:19,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:19,212 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:44:19,212 INFO L226 Difference]: Without dead ends: 43 [2019-11-26 02:44:19,215 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-26 02:44:19,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-26 02:44:19,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-26 02:44:19,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:44:19,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-26 02:44:19,250 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-26 02:44:19,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:19,251 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-26 02:44:19,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-26 02:44:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-26 02:44:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-26 02:44:19,253 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:19,253 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:19,472 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-26 02:44:19,472 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:19,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:19,473 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-26 02:44:19,473 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:19,474 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1366483936] [2019-11-26 02:44:19,474 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:19,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:19,560 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:44:19,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:19,596 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:19,601 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:19,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:19,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1366483936] [2019-11-26 02:44:19,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:19,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:44:19,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207116015] [2019-11-26 02:44:19,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:19,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:19,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:19,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:19,608 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-26 02:44:19,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:19,670 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-26 02:44:19,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-26 02:44:19,671 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-26 02:44:19,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:19,673 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:44:19,673 INFO L226 Difference]: Without dead ends: 50 [2019-11-26 02:44:19,674 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:44:19,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-26 02:44:19,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-26 02:44:19,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-26 02:44:19,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-26 02:44:19,682 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-26 02:44:19,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:19,682 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-26 02:44:19,682 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:19,683 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-26 02:44:19,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-26 02:44:19,683 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:19,684 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:19,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-26 02:44:19,906 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:19,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:19,907 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-26 02:44:19,909 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:19,909 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [671628345] [2019-11-26 02:44:19,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:19,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:44:19,993 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:20,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:20,016 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:20,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:20,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [671628345] [2019-11-26 02:44:20,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:20,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:44:20,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738327311] [2019-11-26 02:44:20,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:44:20,043 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:20,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:44:20,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:44:20,043 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-26 02:44:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:20,164 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-26 02:44:20,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:44:20,165 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-26 02:44:20,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:20,167 INFO L225 Difference]: With dead ends: 96 [2019-11-26 02:44:20,168 INFO L226 Difference]: Without dead ends: 83 [2019-11-26 02:44:20,168 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:44:20,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-26 02:44:20,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-26 02:44:20,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-26 02:44:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-26 02:44:20,177 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-26 02:44:20,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:20,177 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-26 02:44:20,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:44:20,178 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-26 02:44:20,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-26 02:44:20,179 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:20,179 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:20,390 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-26 02:44:20,390 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:20,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:20,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-26 02:44:20,391 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:20,391 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175048622] [2019-11-26 02:44:20,391 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:20,468 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:44:20,470 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:20,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:20,495 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:20,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:20,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:20,560 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:20,562 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:20,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:20,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:20,635 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175048622] [2019-11-26 02:44:20,635 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:20,635 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-26 02:44:20,636 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428249093] [2019-11-26 02:44:20,636 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:44:20,636 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:20,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:44:20,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:44:20,637 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-26 02:44:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:23,193 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2019-11-26 02:44:23,194 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:44:23,194 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-26 02:44:23,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:23,196 INFO L225 Difference]: With dead ends: 146 [2019-11-26 02:44:23,196 INFO L226 Difference]: Without dead ends: 137 [2019-11-26 02:44:23,197 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:44:23,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-11-26 02:44:23,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 75. [2019-11-26 02:44:23,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-26 02:44:23,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-26 02:44:23,209 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-26 02:44:23,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:23,210 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-26 02:44:23,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:44:23,210 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-26 02:44:23,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-26 02:44:23,211 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:23,211 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:23,427 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-26 02:44:23,428 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:23,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:23,428 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-26 02:44:23,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:23,429 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887106565] [2019-11-26 02:44:23,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:23,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:44:23,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:23,543 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:23,544 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:23,564 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:23,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:23,694 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:23,787 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:23,810 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:23,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:23,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887106565] [2019-11-26 02:44:23,846 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:23,846 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-26 02:44:23,846 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301429196] [2019-11-26 02:44:23,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:44:23,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:44:23,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:44:23,848 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-26 02:44:24,707 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 12 [2019-11-26 02:44:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:25,140 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-26 02:44:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-26 02:44:25,140 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-26 02:44:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:25,142 INFO L225 Difference]: With dead ends: 180 [2019-11-26 02:44:25,142 INFO L226 Difference]: Without dead ends: 178 [2019-11-26 02:44:25,143 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-26 02:44:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-26 02:44:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-26 02:44:25,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:44:25,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-26 02:44:25,157 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-26 02:44:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:25,158 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-26 02:44:25,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:44:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-26 02:44:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-26 02:44:25,160 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:25,160 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:25,363 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-26 02:44:25,364 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-26 02:44:25,364 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:25,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946520588] [2019-11-26 02:44:25,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:25,429 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:44:25,431 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:25,454 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:25,455 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:25,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:25,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:25,532 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:25,534 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:25,538 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:25,555 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:25,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946520588] [2019-11-26 02:44:25,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:25,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-26 02:44:25,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343759889] [2019-11-26 02:44:25,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:44:25,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:25,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:44:25,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:44:25,578 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-26 02:44:26,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:26,074 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-26 02:44:26,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:44:26,074 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-26 02:44:26,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:26,075 INFO L225 Difference]: With dead ends: 166 [2019-11-26 02:44:26,075 INFO L226 Difference]: Without dead ends: 131 [2019-11-26 02:44:26,076 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:44:26,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-26 02:44:26,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-26 02:44:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:44:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-26 02:44:26,087 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-26 02:44:26,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:26,088 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-26 02:44:26,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:44:26,088 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-26 02:44:26,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:44:26,089 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:26,089 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:26,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-26 02:44:26,296 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:26,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:26,296 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-26 02:44:26,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:26,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1679591255] [2019-11-26 02:44:26,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:26,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:26,360 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:44:26,362 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:26,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:26,379 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:26,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:26,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1679591255] [2019-11-26 02:44:26,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:26,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-26 02:44:26,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404152011] [2019-11-26 02:44:26,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-26 02:44:26,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:26,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-26 02:44:26,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-26 02:44:26,404 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-26 02:44:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:26,507 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-26 02:44:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-26 02:44:26,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-26 02:44:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:26,508 INFO L225 Difference]: With dead ends: 157 [2019-11-26 02:44:26,508 INFO L226 Difference]: Without dead ends: 141 [2019-11-26 02:44:26,509 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-26 02:44:26,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-26 02:44:26,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-26 02:44:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-26 02:44:26,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-26 02:44:26,531 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-26 02:44:26,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:26,532 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-26 02:44:26,532 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-26 02:44:26,532 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-26 02:44:26,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-26 02:44:26,534 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:26,534 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:26,751 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-26 02:44:26,752 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:26,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:26,752 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-26 02:44:26,752 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:26,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [128595942] [2019-11-26 02:44:26,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-26 02:44:26,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:26,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-26 02:44:26,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:26,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:26,843 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:26,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:26,845 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [128595942] [2019-11-26 02:44:26,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:26,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-26 02:44:26,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542193560] [2019-11-26 02:44:26,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-26 02:44:26,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:26,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-26 02:44:26,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:26,847 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-26 02:44:26,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:26,883 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-26 02:44:26,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-26 02:44:26,884 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-26 02:44:26,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:26,885 INFO L225 Difference]: With dead ends: 96 [2019-11-26 02:44:26,885 INFO L226 Difference]: Without dead ends: 94 [2019-11-26 02:44:26,886 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-26 02:44:26,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-26 02:44:26,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-26 02:44:26,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-26 02:44:26,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-26 02:44:26,910 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-26 02:44:26,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:26,910 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-26 02:44:26,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-26 02:44:26,911 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-26 02:44:26,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:44:26,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:26,916 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:27,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-26 02:44:27,137 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:27,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:27,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-26 02:44:27,137 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:27,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2016555456] [2019-11-26 02:44:27,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:27,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:27,209 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:44:27,216 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:27,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:27,238 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:27,269 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:27,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:27,291 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:27,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:27,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:27,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:27,352 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2016555456] [2019-11-26 02:44:27,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:27,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-26 02:44:27,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042270442] [2019-11-26 02:44:27,352 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:44:27,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:27,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:44:27,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:44:27,353 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-26 02:44:27,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:27,762 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-26 02:44:27,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-26 02:44:27,762 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-26 02:44:27,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:27,763 INFO L225 Difference]: With dead ends: 131 [2019-11-26 02:44:27,763 INFO L226 Difference]: Without dead ends: 118 [2019-11-26 02:44:27,764 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:44:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-26 02:44:27,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-26 02:44:27,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-26 02:44:27,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-26 02:44:27,771 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-26 02:44:27,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:27,772 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-26 02:44:27,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:44:27,772 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-26 02:44:27,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:44:27,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:27,773 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:27,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-26 02:44:27,974 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:27,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:27,974 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-26 02:44:27,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:27,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1190992341] [2019-11-26 02:44:27,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-26 02:44:28,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:28,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-26 02:44:28,051 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:28,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,066 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:28,126 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:28,128 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:28,197 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1190992341] [2019-11-26 02:44:28,197 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:28,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-26 02:44:28,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714594774] [2019-11-26 02:44:28,198 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-26 02:44:28,198 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:28,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-26 02:44:28,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-26 02:44:28,199 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-26 02:44:28,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:28,659 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-26 02:44:28,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:44:28,660 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-26 02:44:28,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:28,660 INFO L225 Difference]: With dead ends: 114 [2019-11-26 02:44:28,660 INFO L226 Difference]: Without dead ends: 78 [2019-11-26 02:44:28,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-26 02:44:28,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-26 02:44:28,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-26 02:44:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-26 02:44:28,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-26 02:44:28,668 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-26 02:44:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:28,668 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-26 02:44:28,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-26 02:44:28,669 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-26 02:44:28,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-26 02:44:28,669 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:28,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:28,870 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-26 02:44:28,870 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:28,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:28,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-26 02:44:28,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:28,871 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1283827811] [2019-11-26 02:44:28,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:28,939 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:44:28,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:28,956 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,957 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:28,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:29,018 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:29,018 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:29,020 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:29,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:29,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:29,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:29,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1283827811] [2019-11-26 02:44:29,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:29,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-26 02:44:29,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935155039] [2019-11-26 02:44:29,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-26 02:44:29,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:29,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-26 02:44:29,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-26 02:44:29,075 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-26 02:44:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:29,358 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-26 02:44:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:44:29,359 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-26 02:44:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:29,360 INFO L225 Difference]: With dead ends: 84 [2019-11-26 02:44:29,360 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:44:29,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-26 02:44:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:44:29,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:44:29,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:44:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-26 02:44:29,367 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-26 02:44:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:29,368 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-26 02:44:29,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-26 02:44:29,369 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-26 02:44:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 02:44:29,371 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:29,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:29,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-26 02:44:29,572 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:29,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:29,572 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-26 02:44:29,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:29,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388817408] [2019-11-26 02:44:29,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:29,651 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-26 02:44:29,653 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:29,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:29,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:29,710 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:29,954 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:30,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:30,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388817408] [2019-11-26 02:44:30,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:30,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-26 02:44:30,035 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185263547] [2019-11-26 02:44:30,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:44:30,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:30,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:44:30,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:44:30,036 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-26 02:44:30,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:30,333 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-26 02:44:30,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-26 02:44:30,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-26 02:44:30,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:30,335 INFO L225 Difference]: With dead ends: 82 [2019-11-26 02:44:30,335 INFO L226 Difference]: Without dead ends: 74 [2019-11-26 02:44:30,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:44:30,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-26 02:44:30,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-26 02:44:30,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-26 02:44:30,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-26 02:44:30,342 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-26 02:44:30,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:30,342 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-26 02:44:30,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:44:30,342 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-26 02:44:30,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-26 02:44:30,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:30,343 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:30,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-26 02:44:30,545 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:30,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:30,547 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-26 02:44:30,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:30,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1866127598] [2019-11-26 02:44:30,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-26 02:44:30,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:30,622 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-26 02:44:30,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:30,672 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:30,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:30,763 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:30,898 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:30,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:30,976 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1866127598] [2019-11-26 02:44:30,976 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:30,976 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-26 02:44:30,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065066940] [2019-11-26 02:44:30,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-26 02:44:30,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:30,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-26 02:44:30,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-26 02:44:30,977 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-26 02:44:32,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:32,183 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-26 02:44:32,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-26 02:44:32,184 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-26 02:44:32,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:32,185 INFO L225 Difference]: With dead ends: 154 [2019-11-26 02:44:32,185 INFO L226 Difference]: Without dead ends: 134 [2019-11-26 02:44:32,186 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-26 02:44:32,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-26 02:44:32,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-26 02:44:32,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-26 02:44:32,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-26 02:44:32,192 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-26 02:44:32,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:32,192 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-26 02:44:32,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-26 02:44:32,192 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-26 02:44:32,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-26 02:44:32,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:32,193 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:32,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-26 02:44:32,404 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:32,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:32,404 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-26 02:44:32,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:32,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [979531367] [2019-11-26 02:44:32,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:32,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:32,480 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-26 02:44:32,482 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:32,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:32,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:32,522 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:32,817 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-26 02:44:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:32,826 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:32,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:32,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:33,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:33,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [979531367] [2019-11-26 02:44:33,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:33,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-26 02:44:33,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100211753] [2019-11-26 02:44:33,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-26 02:44:33,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:33,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-26 02:44:33,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:44:33,013 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-26 02:44:35,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:35,030 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-26 02:44:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-26 02:44:35,031 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-26 02:44:35,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:35,032 INFO L225 Difference]: With dead ends: 195 [2019-11-26 02:44:35,032 INFO L226 Difference]: Without dead ends: 158 [2019-11-26 02:44:35,034 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-26 02:44:35,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-26 02:44:35,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-26 02:44:35,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-26 02:44:35,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-26 02:44:35,040 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-26 02:44:35,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:35,040 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-26 02:44:35,040 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-26 02:44:35,040 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-26 02:44:35,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-26 02:44:35,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:35,041 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:35,257 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-26 02:44:35,257 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:35,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:35,258 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-26 02:44:35,258 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:35,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517425974] [2019-11-26 02:44:35,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:35,316 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-26 02:44:35,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:35,338 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:35,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:35,533 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:35,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:35,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:35,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517425974] [2019-11-26 02:44:35,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:35,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-26 02:44:35,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767701095] [2019-11-26 02:44:35,665 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:44:35,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:35,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:44:35,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:44:35,666 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-26 02:44:36,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:36,488 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-26 02:44:36,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-26 02:44:36,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-26 02:44:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:36,490 INFO L225 Difference]: With dead ends: 125 [2019-11-26 02:44:36,490 INFO L226 Difference]: Without dead ends: 101 [2019-11-26 02:44:36,490 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-26 02:44:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-26 02:44:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-26 02:44:36,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-26 02:44:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-26 02:44:36,494 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-26 02:44:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:36,494 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-26 02:44:36,494 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:44:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-26 02:44:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:44:36,495 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:36,495 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:36,695 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-26 02:44:36,695 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:36,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:36,696 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-26 02:44:36,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:36,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [493861994] [2019-11-26 02:44:36,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:36,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-26 02:44:36,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:36,794 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:36,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:36,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:36,831 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:36,938 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:36,971 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:37,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:37,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [493861994] [2019-11-26 02:44:37,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:37,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-26 02:44:37,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186798371] [2019-11-26 02:44:37,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-26 02:44:37,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:37,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-26 02:44:37,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-26 02:44:37,016 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-26 02:44:37,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:37,491 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-26 02:44:37,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-26 02:44:37,491 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-26 02:44:37,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:37,491 INFO L225 Difference]: With dead ends: 52 [2019-11-26 02:44:37,491 INFO L226 Difference]: Without dead ends: 41 [2019-11-26 02:44:37,492 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-26 02:44:37,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-26 02:44:37,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-26 02:44:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-26 02:44:37,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-26 02:44:37,495 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-26 02:44:37,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:37,495 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-26 02:44:37,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-26 02:44:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-26 02:44:37,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-26 02:44:37,496 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:37,496 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:37,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-26 02:44:37,706 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:37,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:37,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-26 02:44:37,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:37,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315518399] [2019-11-26 02:44:37,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:37,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-26 02:44:37,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:37,798 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:37,811 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:37,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:37,855 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:37,872 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:37,939 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:37,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:37,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:37,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315518399] [2019-11-26 02:44:37,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:37,990 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-26 02:44:37,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007720023] [2019-11-26 02:44:37,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-26 02:44:37,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:37,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-26 02:44:37,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-26 02:44:37,990 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-26 02:44:38,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:38,539 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-26 02:44:38,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-26 02:44:38,539 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-26 02:44:38,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:38,539 INFO L225 Difference]: With dead ends: 55 [2019-11-26 02:44:38,539 INFO L226 Difference]: Without dead ends: 41 [2019-11-26 02:44:38,540 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-11-26 02:44:38,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-26 02:44:38,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-26 02:44:38,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-26 02:44:38,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-26 02:44:38,544 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-26 02:44:38,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:38,545 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-26 02:44:38,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-26 02:44:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-26 02:44:38,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-26 02:44:38,545 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:38,545 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:38,756 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-26 02:44:38,756 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:38,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:38,756 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-26 02:44:38,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:38,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315372470] [2019-11-26 02:44:38,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-26 02:44:38,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:38,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-26 02:44:38,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:38,853 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:38,908 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:38,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-26 02:44:39,020 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:39,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315372470] [2019-11-26 02:44:39,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:39,021 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-26 02:44:39,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6899865] [2019-11-26 02:44:39,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-26 02:44:39,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:39,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-26 02:44:39,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-26 02:44:39,022 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-26 02:44:39,477 WARN L192 SmtUtils]: Spent 319.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-11-26 02:44:39,610 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-11-26 02:44:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:39,893 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-26 02:44:39,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-26 02:44:39,893 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-26 02:44:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:39,894 INFO L225 Difference]: With dead ends: 79 [2019-11-26 02:44:39,894 INFO L226 Difference]: Without dead ends: 61 [2019-11-26 02:44:39,894 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-26 02:44:39,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-26 02:44:39,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-26 02:44:39,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-26 02:44:39,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-26 02:44:39,900 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-26 02:44:39,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:39,901 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-26 02:44:39,901 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-26 02:44:39,901 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-26 02:44:39,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-26 02:44:39,901 INFO L402 BasicCegarLoop]: Found error trace [2019-11-26 02:44:39,902 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-26 02:44:40,102 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-26 02:44:40,102 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-26 02:44:40,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-26 02:44:40,103 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-26 02:44:40,103 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-11-26 02:44:40,103 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607987378] [2019-11-26 02:44:40,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/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 [2019-11-26 02:44:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-26 02:44:40,168 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-26 02:44:40,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-26 02:44:40,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:40,177 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-26 02:44:40,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-26 02:44:40,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607987378] [2019-11-26 02:44:40,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-26 02:44:40,179 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-26 02:44:40,179 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171030858] [2019-11-26 02:44:40,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-26 02:44:40,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-11-26 02:44:40,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-26 02:44:40,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-26 02:44:40,180 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-26 02:44:40,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-26 02:44:40,216 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-26 02:44:40,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-26 02:44:40,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-26 02:44:40,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-26 02:44:40,217 INFO L225 Difference]: With dead ends: 39 [2019-11-26 02:44:40,217 INFO L226 Difference]: Without dead ends: 0 [2019-11-26 02:44:40,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-26 02:44:40,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-26 02:44:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-26 02:44:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-26 02:44:40,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-26 02:44:40,218 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-26 02:44:40,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-26 02:44:40,218 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-26 02:44:40,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-26 02:44:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-26 02:44:40,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-26 02:44:40,419 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-26 02:44:40,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-26 02:44:40,640 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2019-11-26 02:44:40,762 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 135 [2019-11-26 02:44:41,557 WARN L192 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-26 02:44:42,318 WARN L192 SmtUtils]: Spent 760.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 27 [2019-11-26 02:44:42,840 WARN L192 SmtUtils]: Spent 521.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-26 02:44:43,078 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-26 02:44:43,302 WARN L192 SmtUtils]: Spent 223.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-11-26 02:44:43,806 WARN L192 SmtUtils]: Spent 503.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-26 02:44:44,210 WARN L192 SmtUtils]: Spent 402.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2019-11-26 02:44:44,981 WARN L192 SmtUtils]: Spent 769.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 34 [2019-11-26 02:44:45,185 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-26 02:44:45,213 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L447 ceAbstractionStarter]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L440 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-11-26 02:44:45,214 INFO L444 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-11-26 02:44:45,215 INFO L440 ceAbstractionStarter]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-26 02:44:45,215 INFO L444 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-11-26 02:44:45,215 INFO L440 ceAbstractionStarter]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse1 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse2) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (not .cse1) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-26 02:44:45,215 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-26 02:44:45,215 INFO L440 ceAbstractionStarter]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and .cse0 .cse1 .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse3 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (not .cse3) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2019-11-26 02:44:45,215 INFO L440 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-11-26 02:44:45,215 INFO L440 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short11| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-26 02:44:45,215 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-11-26 02:44:45,215 INFO L440 ceAbstractionStarter]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short15|)) (.cse2 (not |ULTIMATE.start_main_#t~short11|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse2 (not .cse0)))) [2019-11-26 02:44:45,215 INFO L440 ceAbstractionStarter]: At program point L57-3(line 57) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short15|) (not |ULTIMATE.start_main_#t~short11|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short14|) [2019-11-26 02:44:45,216 INFO L440 ceAbstractionStarter]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 .cse3 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse1 .cse1))) (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-11-26 02:44:45,216 INFO L440 ceAbstractionStarter]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and .cse0 |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)))) [2019-11-26 02:44:45,216 INFO L440 ceAbstractionStarter]: At program point L57-6(line 57) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))))) [2019-11-26 02:44:45,216 INFO L440 ceAbstractionStarter]: At program point L57-7(line 57) the Hoare annotation is: (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-11-26 02:44:45,216 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-26 02:44:45,216 INFO L444 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-26 02:44:45,216 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-11-26 02:44:45,216 INFO L444 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-11-26 02:44:45,216 INFO L440 ceAbstractionStarter]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse2) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-26 02:44:45,216 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-26 02:44:45,217 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-26 02:44:45,217 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-11-26 02:44:45,217 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-11-26 02:44:45,217 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-26 02:44:45,217 INFO L444 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-26 02:44:45,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 02:44:45 BoogieIcfgContainer [2019-11-26 02:44:45,243 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-26 02:44:45,243 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-26 02:44:45,243 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-26 02:44:45,244 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-26 02:44:45,244 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 02:44:18" (3/4) ... [2019-11-26 02:44:45,247 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-26 02:44:45,259 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-11-26 02:44:45,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-26 02:44:45,260 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-26 02:44:45,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-26 02:44:45,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) [2019-11-26 02:44:45,302 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) [2019-11-26 02:44:45,302 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-11-26 02:44:45,303 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-26 02:44:45,303 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-26 02:44:45,304 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-26 02:44:45,304 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-26 02:44:45,305 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-11-26 02:44:45,306 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-11-26 02:44:45,306 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) [2019-11-26 02:44:45,307 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-11-26 02:44:45,307 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-11-26 02:44:45,350 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c146315f-6545-490d-b054-b0a539400304/bin/utaipan/witness.graphml [2019-11-26 02:44:45,350 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-26 02:44:45,351 INFO L168 Benchmark]: Toolchain (without parser) took 27407.66 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 339.2 MB). Free memory was 957.8 MB in the beginning and 974.1 MB in the end (delta: -16.4 MB). Peak memory consumption was 322.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,352 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:44:45,352 INFO L168 Benchmark]: CACSL2BoogieTranslator took 426.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -195.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,352 INFO L168 Benchmark]: Boogie Procedure Inliner took 48.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,353 INFO L168 Benchmark]: Boogie Preprocessor took 36.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-26 02:44:45,353 INFO L168 Benchmark]: RCFGBuilder took 479.39 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,353 INFO L168 Benchmark]: TraceAbstraction took 26303.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 132.4 MB). Peak memory consumption was 403.9 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,354 INFO L168 Benchmark]: Witness Printer took 107.04 ms. Allocated memory is still 1.4 GB. Free memory was 983.3 MB in the beginning and 974.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2019-11-26 02:44:45,356 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 426.24 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -195.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 48.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 36.60 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 479.39 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: 31.1 MB). Peak memory consumption was 31.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26303.56 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 983.3 MB in the end (delta: 132.4 MB). Peak memory consumption was 403.9 MB. Max. memory is 11.5 GB. * Witness Printer took 107.04 ms. Allocated memory is still 1.4 GB. Free memory was 983.3 MB in the beginning and 974.1 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 26.2s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.7s, HoareTripleCheckerStatistics: 1147 SDtfs, 2730 SDslu, 4439 SDs, 0 SdLazy, 1925 SolverSat, 267 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 6.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 8.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 605 HoareAnnotationTreeSize, 14 FomulaSimplifications, 572522 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 14 FomulaSimplificationsInter, 62940 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93581 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...