./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff .................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-19 22:52:59,563 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:52:59,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:52:59,579 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:52:59,579 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:52:59,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:52:59,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:52:59,584 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:52:59,586 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:52:59,587 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:52:59,588 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:52:59,589 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:52:59,589 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:52:59,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:52:59,596 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:52:59,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:52:59,605 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:52:59,606 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:52:59,608 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:52:59,611 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:52:59,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:52:59,613 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:52:59,614 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:52:59,615 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:52:59,618 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:52:59,618 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:52:59,618 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:52:59,619 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:52:59,619 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:52:59,620 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:52:59,620 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:52:59,621 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:52:59,621 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:52:59,627 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:52:59,630 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:52:59,630 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:52:59,631 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:52:59,631 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:52:59,631 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:52:59,635 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:52:59,636 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:52:59,636 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:52:59,653 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:52:59,653 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:52:59,654 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:52:59,655 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:52:59,655 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:52:59,655 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:52:59,655 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:52:59,656 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:52:59,656 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:52:59,656 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:52:59,657 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:52:59,658 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:52:59,658 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:52:59,658 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:52:59,658 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:52:59,659 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:52:59,659 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:52:59,659 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:52:59,659 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:52:59,659 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:52:59,660 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:52:59,660 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:52:59,660 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:52:59,660 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:52:59,661 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:52:59,661 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:52:59,661 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:52:59,661 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:52:59,662 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-11-19 22:52:59,814 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:52:59,829 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:52:59,832 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:52:59,833 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:52:59,834 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:52:59,834 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-19 22:52:59,903 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/4fca05ce7/38e32413023b4b558448f265eb8e1101/FLAG9fb60b53d [2019-11-19 22:53:00,281 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:53:00,284 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-19 22:53:00,292 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/4fca05ce7/38e32413023b4b558448f265eb8e1101/FLAG9fb60b53d [2019-11-19 22:53:00,689 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/4fca05ce7/38e32413023b4b558448f265eb8e1101 [2019-11-19 22:53:00,692 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:53:00,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:53:00,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:53:00,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:53:00,698 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:53:00,699 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:53:00" (1/1) ... [2019-11-19 22:53:00,701 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d34d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:00, skipping insertion in model container [2019-11-19 22:53:00,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:53:00" (1/1) ... [2019-11-19 22:53:00,708 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:53:00,727 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:53:00,962 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:53:00,965 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:53:00,987 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:53:01,006 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:53:01,007 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01 WrapperNode [2019-11-19 22:53:01,007 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:53:01,008 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:53:01,008 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:53:01,008 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:53:01,016 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,024 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,053 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:53:01,053 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:53:01,053 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:53:01,053 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:53:01,062 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,062 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,065 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,065 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,074 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,078 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,082 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... [2019-11-19 22:53:01,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:53:01,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:53:01,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:53:01,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:53:01,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:53:01,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-19 22:53:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:53:01,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:53:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:53:01,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:53:01,512 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:53:01,512 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-19 22:53:01,513 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:01 BoogieIcfgContainer [2019-11-19 22:53:01,513 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:53:01,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:53:01,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:53:01,517 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:53:01,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:53:00" (1/3) ... [2019-11-19 22:53:01,518 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bec2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:53:01, skipping insertion in model container [2019-11-19 22:53:01,518 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:01" (2/3) ... [2019-11-19 22:53:01,519 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19bec2b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:53:01, skipping insertion in model container [2019-11-19 22:53:01,519 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:01" (3/3) ... [2019-11-19 22:53:01,521 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-19 22:53:01,529 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:53:01,536 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-19 22:53:01,545 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-19 22:53:01,565 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:53:01,565 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:53:01,565 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:53:01,565 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:53:01,565 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:53:01,565 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:53:01,565 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:53:01,566 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:53:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-19 22:53:01,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:53:01,583 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:01,583 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:53:01,584 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:01,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:01,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-19 22:53:01,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:53:01,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024864556] [2019-11-19 22:53:01,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:53:01,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:01,738 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-19 22:53:01,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024864556] [2019-11-19 22:53:01,739 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:01,739 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:53:01,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858283253] [2019-11-19 22:53:01,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:53:01,745 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:53:01,753 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:53:01,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:53:01,755 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-19 22:53:01,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:01,836 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-19 22:53:01,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:53:01,840 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-19 22:53:01,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:01,857 INFO L225 Difference]: With dead ends: 90 [2019-11-19 22:53:01,858 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 22:53:01,861 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:53:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 22:53:01,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-19 22:53:01,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 22:53:01,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-19 22:53:01,907 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-19 22:53:01,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:01,908 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-19 22:53:01,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:53:01,909 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-19 22:53:01,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:53:01,911 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:01,911 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-19 22:53:01,912 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:01,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:01,912 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-19 22:53:01,913 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:53:01,913 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737886694] [2019-11-19 22:53:01,913 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:53:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:01,993 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-19 22:53:01,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737886694] [2019-11-19 22:53:01,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:01,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:53:01,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537123876] [2019-11-19 22:53:01,995 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:53:01,995 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:53:01,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:53:01,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:53:01,996 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-19 22:53:02,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:02,056 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-19 22:53:02,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:53:02,056 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-19 22:53:02,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:02,057 INFO L225 Difference]: With dead ends: 77 [2019-11-19 22:53:02,058 INFO L226 Difference]: Without dead ends: 64 [2019-11-19 22:53:02,059 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:53:02,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-19 22:53:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-19 22:53:02,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 22:53:02,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-19 22:53:02,066 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-19 22:53:02,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:02,066 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-19 22:53:02,066 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:53:02,066 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-19 22:53:02,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:53:02,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:02,067 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-19 22:53:02,068 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:02,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:02,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-19 22:53:02,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:53:02,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386309907] [2019-11-19 22:53:02,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:53:02,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:02,121 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-19 22:53:02,121 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386309907] [2019-11-19 22:53:02,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:02,122 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:53:02,122 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368646071] [2019-11-19 22:53:02,122 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:53:02,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:53:02,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:53:02,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:53:02,123 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-19 22:53:02,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:02,143 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-19 22:53:02,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:53:02,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-19 22:53:02,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:02,145 INFO L225 Difference]: With dead ends: 50 [2019-11-19 22:53:02,145 INFO L226 Difference]: Without dead ends: 48 [2019-11-19 22:53:02,146 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:53:02,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-19 22:53:02,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-19 22:53:02,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-19 22:53:02,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-19 22:53:02,151 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-19 22:53:02,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:02,152 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-19 22:53:02,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:53:02,152 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-19 22:53:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:53:02,153 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:02,153 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-19 22:53:02,153 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-19 22:53:02,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:53:02,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41353537] [2019-11-19 22:53:02,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:53:02,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:53:02,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:53:02,309 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:53:02,311 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:53:02,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:53:02 BoogieIcfgContainer [2019-11-19 22:53:02,361 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:53:02,362 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:53:02,362 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:53:02,363 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:53:02,363 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:01" (3/4) ... [2019-11-19 22:53:02,368 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-19 22:53:02,368 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:53:02,371 INFO L168 Benchmark]: Toolchain (without parser) took 1676.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 943.4 MB in the beginning and 1.0 GB in the end (delta: -92.8 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:02,372 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:53:02,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:02,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.17 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-19 22:53:02,376 INFO L168 Benchmark]: Boogie Preprocessor took 31.88 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:02,377 INFO L168 Benchmark]: RCFGBuilder took 428.29 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: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:02,383 INFO L168 Benchmark]: TraceAbstraction took 847.34 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: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:02,383 INFO L168 Benchmark]: Witness Printer took 6.21 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-19 22:53:02,389 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 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -183.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.17 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. * Boogie Preprocessor took 31.88 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: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 428.29 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: 28.7 MB). Peak memory consumption was 28.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 847.34 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: 55.1 MB). Peak memory consumption was 55.1 MB. Max. memory is 11.5 GB. * Witness Printer took 6.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L21] __uint32_t w; [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; [L70] float res = fmax_float(x, y); [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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-678e011 [2019-11-19 22:53:04,299 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:53:04,300 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:53:04,315 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:53:04,315 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:53:04,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:53:04,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:53:04,319 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:53:04,321 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:53:04,322 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:53:04,323 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:53:04,324 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:53:04,325 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:53:04,326 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:53:04,327 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:53:04,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:53:04,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:53:04,330 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:53:04,332 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:53:04,334 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:53:04,335 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:53:04,336 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:53:04,337 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:53:04,338 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:53:04,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:53:04,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:53:04,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:53:04,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:53:04,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:53:04,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:53:04,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:53:04,345 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:53:04,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:53:04,347 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:53:04,348 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:53:04,348 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:53:04,349 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:53:04,349 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:53:04,350 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:53:04,351 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:53:04,351 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:53:04,352 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-19 22:53:04,366 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:53:04,370 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:53:04,371 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:53:04,371 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:53:04,372 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:53:04,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:53:04,372 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:53:04,372 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:53:04,373 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:53:04,373 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:53:04,373 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:53:04,373 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:53:04,373 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-19 22:53:04,374 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-19 22:53:04,374 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:53:04,374 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:53:04,374 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:53:04,374 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:53:04,375 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:53:04,375 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:53:04,375 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:53:04,375 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:53:04,376 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:53:04,376 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:53:04,376 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:53:04,376 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:53:04,377 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-19 22:53:04,377 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-19 22:53:04,377 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:53:04,377 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-19 22:53:04,377 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_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer 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 -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-11-19 22:53:04,626 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:53:04,637 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:53:04,643 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:53:04,645 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:53:04,645 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:53:04,647 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-19 22:53:04,706 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/48cd2c8fa/69982d5cdc244490873e835ef2edd9cb/FLAGce472806e [2019-11-19 22:53:05,133 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:53:05,134 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-19 22:53:05,140 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/48cd2c8fa/69982d5cdc244490873e835ef2edd9cb/FLAGce472806e [2019-11-19 22:53:05,536 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/data/48cd2c8fa/69982d5cdc244490873e835ef2edd9cb [2019-11-19 22:53:05,543 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:53:05,544 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:53:05,545 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:53:05,545 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:53:05,549 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:53:05,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@441db28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05, skipping insertion in model container [2019-11-19 22:53:05,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,557 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:53:05,572 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:53:05,731 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:53:05,737 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:53:05,761 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:53:05,834 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:53:05,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05 WrapperNode [2019-11-19 22:53:05,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:53:05,836 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:53:05,836 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:53:05,836 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:53:05,844 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,865 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,888 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:53:05,888 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:53:05,888 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:53:05,888 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:53:05,896 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,896 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,900 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,900 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,908 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... [2019-11-19 22:53:05,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:53:05,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:53:05,920 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:53:05,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:53:05,921 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:53:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-19 22:53:05,977 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:53:05,977 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:53:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-19 22:53:05,978 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:53:06,388 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:53:06,388 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-19 22:53:06,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:06 BoogieIcfgContainer [2019-11-19 22:53:06,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:53:06,391 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:53:06,391 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:53:06,394 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:53:06,394 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:53:05" (1/3) ... [2019-11-19 22:53:06,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505dae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:53:06, skipping insertion in model container [2019-11-19 22:53:06,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:53:05" (2/3) ... [2019-11-19 22:53:06,395 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505dae4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:53:06, skipping insertion in model container [2019-11-19 22:53:06,395 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:06" (3/3) ... [2019-11-19 22:53:06,397 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-19 22:53:06,405 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:53:06,411 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-19 22:53:06,419 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-19 22:53:06,437 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:53:06,437 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:53:06,438 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:53:06,438 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:53:06,438 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:53:06,438 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:53:06,438 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:53:06,438 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:53:06,450 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-19 22:53:06,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-19 22:53:06,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:06,457 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:53:06,457 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:06,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:06,462 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-19 22:53:06,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:06,471 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1593216502] [2019-11-19 22:53:06,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:06,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-19 22:53:06,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:06,578 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-19 22:53:06,578 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:06,583 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-19 22:53:06,584 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1593216502] [2019-11-19 22:53:06,584 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:06,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-19 22:53:06,585 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154290308] [2019-11-19 22:53:06,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-19 22:53:06,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:06,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-19 22:53:06,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-19 22:53:06,601 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-19 22:53:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:06,620 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-19 22:53:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-19 22:53:06,621 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-19 22:53:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:06,631 INFO L225 Difference]: With dead ends: 82 [2019-11-19 22:53:06,631 INFO L226 Difference]: Without dead ends: 43 [2019-11-19 22:53:06,635 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-19 22:53:06,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-19 22:53:06,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-19 22:53:06,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-19 22:53:06,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-19 22:53:06,668 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-19 22:53:06,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:06,669 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-19 22:53:06,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-19 22:53:06,669 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-19 22:53:06,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-19 22:53:06,670 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:06,670 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:53:06,882 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-19 22:53:06,882 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:06,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:06,883 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-19 22:53:06,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:06,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1235038823] [2019-11-19 22:53:06,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:06,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:53:06,983 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:07,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-19 22:53:07,018 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:07,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:07,029 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-19 22:53:07,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1235038823] [2019-11-19 22:53:07,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:07,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-19 22:53:07,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610456109] [2019-11-19 22:53:07,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:53:07,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:07,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:53:07,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:53:07,035 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-19 22:53:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:07,094 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-19 22:53:07,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 22:53:07,095 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-19 22:53:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:07,097 INFO L225 Difference]: With dead ends: 82 [2019-11-19 22:53:07,097 INFO L226 Difference]: Without dead ends: 50 [2019-11-19 22:53:07,099 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-19 22:53:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-19 22:53:07,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-19 22:53:07,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-19 22:53:07,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-19 22:53:07,117 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-19 22:53:07,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:07,118 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-19 22:53:07,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:53:07,118 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-19 22:53:07,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-19 22:53:07,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:07,121 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-19 22:53:07,336 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-19 22:53:07,336 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:07,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:07,337 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-19 22:53:07,337 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:07,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [18024240] [2019-11-19 22:53:07,338 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:07,421 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:53:07,423 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:07,440 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-19 22:53:07,440 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:07,459 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-19 22:53:07,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [18024240] [2019-11-19 22:53:07,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:07,460 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 22:53:07,460 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115771500] [2019-11-19 22:53:07,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:53:07,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:07,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:53:07,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:53:07,461 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-19 22:53:07,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:07,558 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-19 22:53:07,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:53:07,559 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-19 22:53:07,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:07,560 INFO L225 Difference]: With dead ends: 96 [2019-11-19 22:53:07,560 INFO L226 Difference]: Without dead ends: 83 [2019-11-19 22:53:07,561 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-19 22:53:07,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-19 22:53:07,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-19 22:53:07,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-19 22:53:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-19 22:53:07,568 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-19 22:53:07,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:07,568 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-19 22:53:07,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:53:07,569 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-19 22:53:07,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-19 22:53:07,569 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:07,570 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-19 22:53:07,790 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-19 22:53:07,791 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:07,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:07,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-19 22:53:07,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:07,792 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [190519866] [2019-11-19 22:53:07,792 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:07,861 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:53:07,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:07,889 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:07,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:07,970 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-19 22:53:07,970 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:07,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:08,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:08,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-19 22:53:08,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [190519866] [2019-11-19 22:53:08,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:08,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-19 22:53:08,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438074801] [2019-11-19 22:53:08,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:53:08,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:08,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:53:08,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:53:08,043 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-19 22:53:08,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:08,514 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-11-19 22:53:08,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:53:08,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-19 22:53:08,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:08,516 INFO L225 Difference]: With dead ends: 149 [2019-11-19 22:53:08,516 INFO L226 Difference]: Without dead ends: 140 [2019-11-19 22:53:08,517 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:53:08,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-19 22:53:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-11-19 22:53:08,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-19 22:53:08,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-19 22:53:08,538 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-19 22:53:08,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:08,540 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-19 22:53:08,540 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:53:08,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-19 22:53:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-19 22:53:08,542 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:08,543 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-19 22:53:08,765 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-19 22:53:08,766 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:08,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:08,766 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-19 22:53:08,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:08,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267683700] [2019-11-19 22:53:08,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:08,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:08,854 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:53:08,856 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:08,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:08,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:08,916 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:09,061 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-19 22:53:09,061 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:09,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:09,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:09,203 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-19 22:53:09,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267683700] [2019-11-19 22:53:09,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:09,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-19 22:53:09,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848877203] [2019-11-19 22:53:09,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 22:53:09,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:09,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 22:53:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:53:09,205 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-19 22:53:10,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:10,389 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-19 22:53:10,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-19 22:53:10,390 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-19 22:53:10,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:10,391 INFO L225 Difference]: With dead ends: 180 [2019-11-19 22:53:10,392 INFO L226 Difference]: Without dead ends: 178 [2019-11-19 22:53:10,392 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-19 22:53:10,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-19 22:53:10,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-19 22:53:10,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 22:53:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-19 22:53:10,418 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-19 22:53:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:10,419 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-19 22:53:10,419 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 22:53:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-19 22:53:10,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-19 22:53:10,424 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:10,425 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-19 22:53:10,637 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-19 22:53:10,638 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:10,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:10,638 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-19 22:53:10,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:10,638 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [397276239] [2019-11-19 22:53:10,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:10,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:10,715 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:53:10,716 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:10,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:10,833 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:10,862 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-19 22:53:10,862 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:10,864 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:10,868 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:10,882 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:10,903 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-19 22:53:10,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [397276239] [2019-11-19 22:53:10,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:10,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-19 22:53:10,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955671459] [2019-11-19 22:53:10,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:53:10,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:10,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:53:10,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:53:10,905 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-19 22:53:11,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:11,357 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-19 22:53:11,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:53:11,358 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-19 22:53:11,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:11,359 INFO L225 Difference]: With dead ends: 166 [2019-11-19 22:53:11,359 INFO L226 Difference]: Without dead ends: 131 [2019-11-19 22:53:11,360 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-19 22:53:11,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-19 22:53:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-19 22:53:11,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 22:53:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-19 22:53:11,371 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-19 22:53:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:11,372 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-19 22:53:11,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:53:11,372 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-19 22:53:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:53:11,373 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:11,373 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-19 22:53:11,594 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-19 22:53:11,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:11,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:11,594 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-19 22:53:11,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:11,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1359877906] [2019-11-19 22:53:11,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:11,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:53:11,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:11,702 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-19 22:53:11,702 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:11,715 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-19 22:53:11,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1359877906] [2019-11-19 22:53:11,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:11,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-19 22:53:11,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94370725] [2019-11-19 22:53:11,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-19 22:53:11,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:11,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-19 22:53:11,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-19 22:53:11,719 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-19 22:53:11,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:11,810 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-19 22:53:11,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:53:11,811 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-19 22:53:11,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:11,813 INFO L225 Difference]: With dead ends: 157 [2019-11-19 22:53:11,813 INFO L226 Difference]: Without dead ends: 141 [2019-11-19 22:53:11,814 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-19 22:53:11,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-19 22:53:11,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-19 22:53:11,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-19 22:53:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-19 22:53:11,833 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-19 22:53:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:11,834 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-19 22:53:11,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-19 22:53:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-19 22:53:11,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-19 22:53:11,835 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:11,835 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-19 22:53:12,048 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-19 22:53:12,048 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:12,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:12,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-19 22:53:12,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:12,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593399345] [2019-11-19 22:53:12,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:12,120 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-19 22:53:12,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:12,125 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-19 22:53:12,126 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:12,127 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-19 22:53:12,127 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593399345] [2019-11-19 22:53:12,127 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:12,127 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-19 22:53:12,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509081736] [2019-11-19 22:53:12,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:53:12,128 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:12,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:53:12,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:53:12,129 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-19 22:53:12,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:12,156 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-19 22:53:12,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:53:12,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-19 22:53:12,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:12,158 INFO L225 Difference]: With dead ends: 96 [2019-11-19 22:53:12,158 INFO L226 Difference]: Without dead ends: 94 [2019-11-19 22:53:12,158 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-19 22:53:12,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-19 22:53:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-19 22:53:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-19 22:53:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-19 22:53:12,167 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-19 22:53:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:12,168 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-19 22:53:12,168 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:53:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-19 22:53:12,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:53:12,169 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:12,169 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-19 22:53:12,391 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-19 22:53:12,391 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:12,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:12,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-19 22:53:12,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:12,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170352062] [2019-11-19 22:53:12,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:12,449 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:53:12,451 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:12,467 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:12,504 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:12,530 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-19 22:53:12,531 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:12,532 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:12,569 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:12,592 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-19 22:53:12,592 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [170352062] [2019-11-19 22:53:12,592 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:12,592 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-19 22:53:12,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356859791] [2019-11-19 22:53:12,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:53:12,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:12,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:53:12,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:53:12,593 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-19 22:53:13,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:13,026 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-19 22:53:13,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-19 22:53:13,027 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-19 22:53:13,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:13,028 INFO L225 Difference]: With dead ends: 131 [2019-11-19 22:53:13,028 INFO L226 Difference]: Without dead ends: 118 [2019-11-19 22:53:13,028 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-19 22:53:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-19 22:53:13,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-19 22:53:13,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-19 22:53:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-19 22:53:13,038 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-19 22:53:13,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:13,039 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-19 22:53:13,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:53:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-19 22:53:13,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:53:13,041 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:13,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] [2019-11-19 22:53:13,242 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-19 22:53:13,242 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:13,242 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-19 22:53:13,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:13,243 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [923854702] [2019-11-19 22:53:13,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:13,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-19 22:53:13,313 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:13,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:13,367 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:13,400 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-19 22:53:13,401 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:13,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:13,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:13,441 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:13,469 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-19 22:53:13,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [923854702] [2019-11-19 22:53:13,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:13,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-19 22:53:13,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832577052] [2019-11-19 22:53:13,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-19 22:53:13,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:13,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-19 22:53:13,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:53:13,471 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-19 22:53:13,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:13,864 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-19 22:53:13,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:53:13,864 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-19 22:53:13,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:13,865 INFO L225 Difference]: With dead ends: 114 [2019-11-19 22:53:13,865 INFO L226 Difference]: Without dead ends: 78 [2019-11-19 22:53:13,865 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-19 22:53:13,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-19 22:53:13,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-19 22:53:13,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-19 22:53:13,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-19 22:53:13,871 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-19 22:53:13,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:13,871 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-19 22:53:13,872 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-19 22:53:13,872 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-19 22:53:13,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-19 22:53:13,873 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:13,873 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-19 22:53:14,078 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-19 22:53:14,083 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:14,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-19 22:53:14,084 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:14,084 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [282815031] [2019-11-19 22:53:14,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:14,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:14,147 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:53:14,148 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:14,164 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:14,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:14,219 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-19 22:53:14,219 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:14,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:14,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:14,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:14,266 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-19 22:53:14,266 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [282815031] [2019-11-19 22:53:14,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:14,267 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-19 22:53:14,267 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429412262] [2019-11-19 22:53:14,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:53:14,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:14,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:53:14,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:53:14,268 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-19 22:53:14,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:14,557 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-19 22:53:14,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:53:14,557 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-19 22:53:14,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:14,558 INFO L225 Difference]: With dead ends: 84 [2019-11-19 22:53:14,558 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:53:14,559 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:53:14,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:53:14,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 22:53:14,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 22:53:14,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-19 22:53:14,564 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-19 22:53:14,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:14,564 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-19 22:53:14,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:53:14,564 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-19 22:53:14,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:53:14,565 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:14,565 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-19 22:53:14,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-19 22:53:14,782 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:14,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:14,782 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-19 22:53:14,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:14,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927297651] [2019-11-19 22:53:14,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:14,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-19 22:53:14,859 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:14,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:14,932 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-19 22:53:14,932 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:15,139 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:15,191 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-19 22:53:15,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927297651] [2019-11-19 22:53:15,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:15,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 22:53:15,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537485280] [2019-11-19 22:53:15,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:53:15,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:15,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:53:15,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:53:15,193 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-19 22:53:15,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:15,494 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-19 22:53:15,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:53:15,495 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-19 22:53:15,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:15,495 INFO L225 Difference]: With dead ends: 82 [2019-11-19 22:53:15,496 INFO L226 Difference]: Without dead ends: 74 [2019-11-19 22:53:15,496 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:53:15,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-19 22:53:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-19 22:53:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-19 22:53:15,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-19 22:53:15,503 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-19 22:53:15,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:15,503 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-19 22:53:15,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:53:15,503 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-19 22:53:15,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-19 22:53:15,510 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:15,510 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-19 22:53:15,723 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-19 22:53:15,723 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:15,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:15,723 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-19 22:53:15,724 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:15,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [509782850] [2019-11-19 22:53:15,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:15,800 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-19 22:53:15,802 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:15,829 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:15,919 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-19 22:53:15,919 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:16,044 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:16,132 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-19 22:53:16,132 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [509782850] [2019-11-19 22:53:16,132 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:16,132 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-19 22:53:16,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156915305] [2019-11-19 22:53:16,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-19 22:53:16,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:16,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-19 22:53:16,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-19 22:53:16,134 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-19 22:53:17,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:17,354 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-19 22:53:17,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-19 22:53:17,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-19 22:53:17,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:17,356 INFO L225 Difference]: With dead ends: 154 [2019-11-19 22:53:17,356 INFO L226 Difference]: Without dead ends: 134 [2019-11-19 22:53:17,357 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-19 22:53:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-19 22:53:17,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-19 22:53:17,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-19 22:53:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-19 22:53:17,363 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-19 22:53:17,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:17,363 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-19 22:53:17,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-19 22:53:17,363 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-19 22:53:17,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-19 22:53:17,364 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:17,364 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-19 22:53:17,578 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-19 22:53:17,578 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:17,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:17,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-19 22:53:17,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:17,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [119668421] [2019-11-19 22:53:17,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:17,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:17,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-19 22:53:17,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:17,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:17,650 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:17,664 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:17,939 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-19 22:53:17,939 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:18,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:18,085 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:18,109 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-19 22:53:18,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [119668421] [2019-11-19 22:53:18,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:18,109 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-19 22:53:18,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461263705] [2019-11-19 22:53:18,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-19 22:53:18,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:18,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-19 22:53:18,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:53:18,110 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-19 22:53:20,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:20,585 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-19 22:53:20,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:53:20,586 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-19 22:53:20,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:20,587 INFO L225 Difference]: With dead ends: 195 [2019-11-19 22:53:20,587 INFO L226 Difference]: Without dead ends: 158 [2019-11-19 22:53:20,589 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-19 22:53:20,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-19 22:53:20,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-19 22:53:20,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-19 22:53:20,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-19 22:53:20,595 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-19 22:53:20,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:20,595 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-19 22:53:20,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-19 22:53:20,595 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-19 22:53:20,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-19 22:53:20,595 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:20,596 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-19 22:53:20,808 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-19 22:53:20,809 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:20,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:20,809 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-19 22:53:20,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:20,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815796927] [2019-11-19 22:53:20,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:20,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:20,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-19 22:53:20,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:20,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:20,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:21,097 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-19 22:53:21,097 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:21,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:21,238 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-19 22:53:21,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815796927] [2019-11-19 22:53:21,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:21,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-19 22:53:21,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895473191] [2019-11-19 22:53:21,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:53:21,240 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:21,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:53:21,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:53:21,240 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-19 22:53:22,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:22,295 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-19 22:53:22,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-19 22:53:22,296 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-19 22:53:22,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:22,297 INFO L225 Difference]: With dead ends: 125 [2019-11-19 22:53:22,297 INFO L226 Difference]: Without dead ends: 101 [2019-11-19 22:53:22,298 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-19 22:53:22,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-19 22:53:22,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-19 22:53:22,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 22:53:22,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-19 22:53:22,302 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-19 22:53:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:22,302 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-19 22:53:22,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:53:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-19 22:53:22,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:53:22,303 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:22,303 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-19 22:53:22,515 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-19 22:53:22,515 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:22,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:22,516 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-19 22:53:22,516 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:22,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587865290] [2019-11-19 22:53:22,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:22,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-19 22:53:22,613 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:22,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:22,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:22,648 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:22,673 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-19 22:53:22,673 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:22,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:22,839 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:22,904 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-19 22:53:22,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587865290] [2019-11-19 22:53:22,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:22,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-19 22:53:22,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614478349] [2019-11-19 22:53:22,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-19 22:53:22,905 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:22,905 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-19 22:53:22,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-19 22:53:22,905 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-19 22:53:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:23,733 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-19 22:53:23,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-19 22:53:23,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-19 22:53:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:23,734 INFO L225 Difference]: With dead ends: 52 [2019-11-19 22:53:23,734 INFO L226 Difference]: Without dead ends: 41 [2019-11-19 22:53:23,734 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-19 22:53:23,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-19 22:53:23,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-19 22:53:23,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-19 22:53:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-19 22:53:23,739 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-19 22:53:23,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:23,739 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-19 22:53:23,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-19 22:53:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-19 22:53:23,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-19 22:53:23,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:23,740 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-19 22:53:23,942 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-19 22:53:23,942 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:23,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:23,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-19 22:53:23,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:23,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [992996279] [2019-11-19 22:53:23,943 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:24,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:24,046 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-19 22:53:24,050 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:24,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:24,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:24,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:24,122 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-19 22:53:24,122 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:24,141 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:24,196 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:24,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:24,247 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-19 22:53:24,247 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [992996279] [2019-11-19 22:53:24,247 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:24,247 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-19 22:53:24,247 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339290192] [2019-11-19 22:53:24,248 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-19 22:53:24,248 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:24,248 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-19 22:53:24,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-19 22:53:24,248 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-19 22:53:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:24,791 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-19 22:53:24,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-19 22:53:24,792 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-19 22:53:24,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:24,793 INFO L225 Difference]: With dead ends: 55 [2019-11-19 22:53:24,793 INFO L226 Difference]: Without dead ends: 41 [2019-11-19 22:53:24,793 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-19 22:53:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-19 22:53:24,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-19 22:53:24,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 22:53:24,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-19 22:53:24,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-19 22:53:24,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:24,799 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-19 22:53:24,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-19 22:53:24,799 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-19 22:53:24,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-19 22:53:24,799 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:24,800 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-19 22:53:25,008 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-19 22:53:25,009 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:25,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:25,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-19 22:53:25,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:25,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1955837390] [2019-11-19 22:53:25,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:25,075 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-19 22:53:25,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:25,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:25,240 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-19 22:53:25,240 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:25,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-19 22:53:25,369 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-19 22:53:25,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1955837390] [2019-11-19 22:53:25,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:25,369 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-19 22:53:25,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086844441] [2019-11-19 22:53:25,370 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-19 22:53:25,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:25,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-19 22:53:25,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-19 22:53:25,370 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-19 22:53:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:26,086 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-19 22:53:26,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:53:26,086 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-19 22:53:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:26,087 INFO L225 Difference]: With dead ends: 79 [2019-11-19 22:53:26,087 INFO L226 Difference]: Without dead ends: 61 [2019-11-19 22:53:26,087 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-19 22:53:26,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-19 22:53:26,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-19 22:53:26,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-19 22:53:26,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-19 22:53:26,091 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-19 22:53:26,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:26,092 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-19 22:53:26,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-19 22:53:26,092 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-19 22:53:26,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-19 22:53:26,092 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:53:26,092 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-19 22:53:26,304 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-19 22:53:26,305 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:53:26,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:53:26,305 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-19 22:53:26,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-19 22:53:26,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208333614] [2019-11-19 22:53:26,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/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-19 22:53:26,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:53:26,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-19 22:53:26,401 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:53:26,417 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-19 22:53:26,417 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-19 22:53:26,419 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-19 22:53:26,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208333614] [2019-11-19 22:53:26,420 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:53:26,420 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-19 22:53:26,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720089982] [2019-11-19 22:53:26,421 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:53:26,421 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-19 22:53:26,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:53:26,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:53:26,422 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-19 22:53:26,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:53:26,442 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-19 22:53:26,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:53:26,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-19 22:53:26,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:53:26,443 INFO L225 Difference]: With dead ends: 39 [2019-11-19 22:53:26,443 INFO L226 Difference]: Without dead ends: 0 [2019-11-19 22:53:26,443 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-19 22:53:26,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-19 22:53:26,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-19 22:53:26,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-19 22:53:26,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-19 22:53:26,444 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-19 22:53:26,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:53:26,444 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-19 22:53:26,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:53:26,444 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-19 22:53:26,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-19 22:53:26,644 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-19 22:53:26,648 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-19 22:53:26,850 WARN L191 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 87 [2019-11-19 22:53:27,144 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 133 [2019-11-19 22:53:27,718 WARN L191 SmtUtils]: Spent 496.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-19 22:53:28,230 WARN L191 SmtUtils]: Spent 510.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 26 [2019-11-19 22:53:28,571 WARN L191 SmtUtils]: Spent 340.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-11-19 22:53:29,205 WARN L191 SmtUtils]: Spent 632.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 32 [2019-11-19 22:53:29,554 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 34 [2019-11-19 22:53:29,790 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 32 [2019-11-19 22:53:30,449 WARN L191 SmtUtils]: Spent 658.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 36 [2019-11-19 22:53:30,889 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2019-11-19 22:53:31,032 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-19 22:53:31,105 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L447 ceAbstractionStarter]: At program point L85(lines 57 86) the Hoare annotation is: true [2019-11-19 22:53:31,106 INFO L444 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L444 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L444 ceAbstractionStarter]: For program point L37-1(lines 37 40) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L444 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L444 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-19 22:53:31,106 INFO L440 ceAbstractionStarter]: At program point L55(line 55) 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-19 22:53:31,106 INFO L440 ceAbstractionStarter]: At program point L55-1(line 55) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short9| (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-19 22:53:31,106 INFO L440 ceAbstractionStarter]: At program point L55-2(line 55) the Hoare annotation is: (let ((.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse0 (not |ULTIMATE.start_main_#t~short13|)) (.cse1 (not |ULTIMATE.start_main_#t~short9|))) (or (and .cse0 .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse2))) (and .cse2 .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-19 22:53:31,106 INFO L440 ceAbstractionStarter]: At program point L55-3(line 55) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short13|) (not |ULTIMATE.start_main_#t~short9|) (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~short12|) [2019-11-19 22:53:31,107 INFO L440 ceAbstractionStarter]: At program point L55-4(line 55) 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_fmax_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 (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) .cse0 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 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 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)) (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y .cse1) .cse0 .cse2 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse3 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)))) [2019-11-19 22:53:31,107 INFO L440 ceAbstractionStarter]: At program point L55-5(line 55) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_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 (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_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))) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (and |ULTIMATE.start_main_#t~short17| .cse2) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and |ULTIMATE.start_main_#t~short17| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2))) [2019-11-19 22:53:31,107 INFO L440 ceAbstractionStarter]: At program point L55-6(line 55) 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 (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 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-19 22:53:31,107 INFO L440 ceAbstractionStarter]: At program point L55-7(line 55) the Hoare annotation is: (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (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-19 22:53:31,107 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-19 22:53:31,107 INFO L444 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2019-11-19 22:53:31,107 INFO L444 ceAbstractionStarter]: For program point L31-1(lines 31 40) no Hoare annotation was computed. [2019-11-19 22:53:31,107 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2019-11-19 22:53:31,107 INFO L440 ceAbstractionStarter]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse0 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))) (or (and (not .cse0) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) [2019-11-19 22:53:31,107 INFO L444 ceAbstractionStarter]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2019-11-19 22:53:31,108 INFO L444 ceAbstractionStarter]: For program point L23-5(lines 23 27) no Hoare annotation was computed. [2019-11-19 22:53:31,108 INFO L440 ceAbstractionStarter]: At program point L23-6(lines 23 27) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1) (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)))) [2019-11-19 22:53:31,108 INFO L444 ceAbstractionStarter]: For program point L23-7(lines 20 41) no Hoare annotation was computed. [2019-11-19 22:53:31,108 INFO L444 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2019-11-19 22:53:31,108 INFO L444 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-19 22:53:31,108 INFO L440 ceAbstractionStarter]: At program point L40(lines 20 41) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse0 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))) (or (and (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmax_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))) (and (not .cse0) (and (and (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|))) (and (and (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) [2019-11-19 22:53:31,108 INFO L440 ceAbstractionStarter]: At program point L40-1(lines 20 41) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.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))) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and (= ULTIMATE.start_fmax_float_~y .cse0) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) .cse1 (not .cse2) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse3) (and (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq .cse0 .cse0)) .cse3 (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) .cse2))) [2019-11-19 22:53:31,108 INFO L444 ceAbstractionStarter]: For program point L73-2(lines 73 76) no Hoare annotation was computed. [2019-11-19 22:53:31,108 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-19 22:53:31,108 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L34-1(lines 34 40) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L67-5(lines 67 83) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L67-7(lines 67 83) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L440 ceAbstractionStarter]: At program point L51-3(lines 43 52) 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_fmax_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 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= ULTIMATE.start_fmax_float_~y .cse2) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and (not (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-19 22:53:31,109 INFO L444 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-19 22:53:31,168 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:53:31 BoogieIcfgContainer [2019-11-19 22:53:31,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:53:31,173 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:53:31,173 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:53:31,173 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:53:31,173 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:53:06" (3/4) ... [2019-11-19 22:53:31,177 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-19 22:53:31,195 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-19 22:53:31,195 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-19 22:53:31,196 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-19 22:53:31,219 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-19 22:53:31,220 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-19 22:53:31,220 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((~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) [2019-11-19 22:53:31,220 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-19 22:53:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && y == y) || ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-11-19 22:53:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == x && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!~fp.eq~FLOAT(y, y) && (!(0bv32 == \result) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) || ((((!~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-11-19 22:53:31,221 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && 1bv32 == \result) && y == y) && !~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-19 22:53:31,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) || (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-11-19 22:53:31,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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]))) || (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res)) || (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) [2019-11-19 22:53:31,222 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && y == y) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((1bv32 == \result && y == y) && !~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 == x) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-19 22:53:31,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) [2019-11-19 22:53:31,223 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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-19 22:53:31,224 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~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-19 22:53:31,273 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8fd7049f-e63c-4255-974e-edea34aca48b/bin/uautomizer/witness.graphml [2019-11-19 22:53:31,274 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:53:31,275 INFO L168 Benchmark]: Toolchain (without parser) took 25730.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 347.1 MB). Free memory was 957.8 MB in the beginning and 1.0 GB in the end (delta: -79.4 MB). Peak memory consumption was 267.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:31,275 INFO L168 Benchmark]: CDTParser took 0.30 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-19 22:53:31,276 INFO L168 Benchmark]: CACSL2BoogieTranslator took 289.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -196.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:31,276 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.34 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-19 22:53:31,276 INFO L168 Benchmark]: Boogie Preprocessor took 31.87 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-19 22:53:31,277 INFO L168 Benchmark]: RCFGBuilder took 469.61 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:31,277 INFO L168 Benchmark]: TraceAbstraction took 24781.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.9 MB). Peak memory consumption was 404.1 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:31,277 INFO L168 Benchmark]: Witness Printer took 100.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-11-19 22:53:31,279 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.30 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 289.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 157.8 MB). Free memory was 957.8 MB in the beginning and 1.2 GB in the end (delta: -196.9 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.34 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 31.87 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 469.61 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: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 24781.91 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 189.3 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 68.9 MB). Peak memory consumption was 404.1 MB. Max. memory is 11.5 GB. * Witness Printer took 100.95 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, x)) && 1bv32 == \result) && y == y) && !~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: 55]: Loop Invariant Derived loop invariant: ((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~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: 55]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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: 23]: Loop Invariant Derived loop invariant: ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) || (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && y == y) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((1bv32 == \result && y == y) && !~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 == x) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((x == x && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!~fp.eq~FLOAT(y, y) && (!(0bv32 == \result) && y == y) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) || ((((!~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((!~fp.eq~FLOAT(y, y) && ~fp.eq~FLOAT(x, x)) && y == y) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, 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]))) || (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res)) || (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) - InvariantResult [Line: 55]: 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: 55]: Loop Invariant Derived loop invariant: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((~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) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && y == y) || ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 55]: 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: 55]: 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: 24.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.4s, HoareTripleCheckerStatistics: 1149 SDtfs, 2823 SDslu, 4377 SDs, 0 SdLazy, 1918 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 7.8s 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, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 618 HoareAnnotationTreeSize, 14 FomulaSimplifications, 651116 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 12067 FormulaSimplificationTreeSizeReductionInter, 3.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93713 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1394 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...