./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-cad4683 [2019-11-15 23:55:47,712 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:55:47,714 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:55:47,729 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:55:47,730 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:55:47,731 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:55:47,733 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:55:47,742 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:55:47,746 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:55:47,750 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:55:47,751 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:55:47,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:55:47,752 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:55:47,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:55:47,753 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:55:47,754 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:55:47,755 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:55:47,755 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:55:47,757 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:55:47,758 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:55:47,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:55:47,761 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:55:47,762 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:55:47,762 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:55:47,767 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:55:47,768 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:55:47,768 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:55:47,770 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:55:47,770 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:55:47,772 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:55:47,772 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:55:47,773 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:55:47,773 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:55:47,774 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:55:47,778 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:55:47,779 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:55:47,779 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:55:47,779 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:55:47,780 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:55:47,783 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:55:47,784 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:55:47,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:55:47,798 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:55:47,799 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:55:47,800 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:55:47,800 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:55:47,800 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:55:47,801 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:55:47,801 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:55:47,801 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:55:47,801 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:55:47,801 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:55:47,802 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:55:47,802 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:55:47,802 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:55:47,802 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:55:47,802 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:55:47,803 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:55:47,803 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:55:47,803 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:55:47,803 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:55:47,803 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:55:47,804 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:55:47,804 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:55:47,804 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:55:47,804 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:55:47,804 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:55:47,805 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:55:47,805 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:55:47,805 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:55:47,805 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_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:47,835 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:55:47,845 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:55:47,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:55:47,849 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:55:47,850 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:55:47,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-15 23:55:47,903 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/d6aa871c6/004dde01885d471b8967b297a50200a0/FLAGd21a4b098 [2019-11-15 23:55:48,335 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:55:48,335 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-15 23:55:48,343 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/d6aa871c6/004dde01885d471b8967b297a50200a0/FLAGd21a4b098 [2019-11-15 23:55:48,361 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/d6aa871c6/004dde01885d471b8967b297a50200a0 [2019-11-15 23:55:48,364 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:55:48,365 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:55:48,366 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:48,366 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:55:48,369 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:55:48,370 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bb610d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48, skipping insertion in model container [2019-11-15 23:55:48,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,381 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:55:48,402 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:55:48,667 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:48,671 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:55:48,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:48,711 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:55:48,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48 WrapperNode [2019-11-15 23:55:48,712 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:48,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:48,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:55:48,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:55:48,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:48,752 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:55:48,752 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:55:48,752 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:55:48,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,774 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,779 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... [2019-11-15 23:55:48,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:55:48,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:55:48,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:55:48,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:55:48,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:48,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:55:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-15 23:55:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:55:48,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:55:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 23:55:48,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:55:49,238 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:55:49,238 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-15 23:55:49,239 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:49 BoogieIcfgContainer [2019-11-15 23:55:49,239 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:55:49,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:55:49,240 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:55:49,243 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:55:49,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:55:48" (1/3) ... [2019-11-15 23:55:49,244 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2566a1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:49, skipping insertion in model container [2019-11-15 23:55:49,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:48" (2/3) ... [2019-11-15 23:55:49,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2566a1ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:49, skipping insertion in model container [2019-11-15 23:55:49,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:49" (3/3) ... [2019-11-15 23:55:49,246 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-15 23:55:49,255 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:55:49,261 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-15 23:55:49,270 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-15 23:55:49,291 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:55:49,291 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:55:49,292 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:55:49,292 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:55:49,292 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:55:49,292 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:55:49,292 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:55:49,292 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:55:49,312 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-15 23:55:49,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:55:49,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:49,319 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:49,321 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:49,325 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-15 23:55:49,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:49,330 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169522299] [2019-11-15 23:55:49,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:49,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:49,485 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-15 23:55:49,485 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169522299] [2019-11-15 23:55:49,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:49,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:49,487 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290071650] [2019-11-15 23:55:49,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:49,490 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:49,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:49,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:49,507 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-15 23:55:49,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:49,600 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-15 23:55:49,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:49,602 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-15 23:55:49,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:49,611 INFO L225 Difference]: With dead ends: 90 [2019-11-15 23:55:49,611 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 23:55:49,614 INFO L600 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-15 23:55:49,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 23:55:49,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-15 23:55:49,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 23:55:49,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-15 23:55:49,661 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-15 23:55:49,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:49,662 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-15 23:55:49,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:49,662 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-15 23:55:49,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:55:49,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:49,664 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:49,664 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:49,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:49,665 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-15 23:55:49,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:49,665 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676776638] [2019-11-15 23:55:49,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:49,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:49,741 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-15 23:55:49,742 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676776638] [2019-11-15 23:55:49,742 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:49,742 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:55:49,742 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981704782] [2019-11-15 23:55:49,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:49,744 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:49,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:49,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:49,745 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-15 23:55:49,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:49,802 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-15 23:55:49,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:55:49,803 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-15 23:55:49,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:49,805 INFO L225 Difference]: With dead ends: 77 [2019-11-15 23:55:49,805 INFO L226 Difference]: Without dead ends: 64 [2019-11-15 23:55:49,806 INFO L600 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-15 23:55:49,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-15 23:55:49,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-15 23:55:49,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 23:55:49,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-15 23:55:49,814 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-15 23:55:49,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:49,815 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-15 23:55:49,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:49,815 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-15 23:55:49,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:55:49,816 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:49,816 INFO L380 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-15 23:55:49,817 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:49,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:49,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-15 23:55:49,818 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:49,818 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571888760] [2019-11-15 23:55:49,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:49,882 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-15 23:55:49,882 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571888760] [2019-11-15 23:55:49,883 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:49,883 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:55:49,883 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020712121] [2019-11-15 23:55:49,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:49,884 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:55:49,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:49,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:49,884 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-15 23:55:49,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:49,911 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-15 23:55:49,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:49,912 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 23:55:49,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:49,913 INFO L225 Difference]: With dead ends: 50 [2019-11-15 23:55:49,913 INFO L226 Difference]: Without dead ends: 48 [2019-11-15 23:55:49,914 INFO L600 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-15 23:55:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-15 23:55:49,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-15 23:55:49,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-15 23:55:49,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-15 23:55:49,920 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-15 23:55:49,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:49,921 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-15 23:55:49,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:49,921 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-15 23:55:49,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:55:49,922 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:49,922 INFO L380 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-15 23:55:49,923 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:49,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:49,923 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-15 23:55:49,923 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:55:49,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961602443] [2019-11-15 23:55:49,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,924 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:55:49,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:55:49,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:50,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:55:50,056 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:55:50,056 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:55:50,089 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:55:50 BoogieIcfgContainer [2019-11-15 23:55:50,089 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:55:50,090 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:55:50,090 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:55:50,090 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:55:50,091 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:49" (3/4) ... [2019-11-15 23:55:50,095 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 23:55:50,095 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:55:50,097 INFO L168 Benchmark]: Toolchain (without parser) took 1731.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -94.7 MB). Peak memory consumption was 38.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:50,098 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:55:50,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 345.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:50,099 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.79 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:50,100 INFO L168 Benchmark]: Boogie Preprocessor took 32.55 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-15 23:55:50,100 INFO L168 Benchmark]: RCFGBuilder took 454.21 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:50,101 INFO L168 Benchmark]: TraceAbstraction took 849.82 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:55:50,101 INFO L168 Benchmark]: Witness Printer took 5.00 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-15 23:55:50,105 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 345.82 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 132.6 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -182.9 MB). Peak memory consumption was 22.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.79 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.55 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 454.21 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: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 849.82 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Witness Printer took 5.00 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-cad4683 [2019-11-15 23:55:52,200 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:55:52,202 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:55:52,220 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:55:52,220 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:55:52,221 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:55:52,223 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:55:52,232 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:55:52,236 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:55:52,240 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:55:52,242 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:55:52,244 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:55:52,244 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:55:52,246 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:55:52,247 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:55:52,249 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:55:52,250 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:55:52,251 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:55:52,254 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:55:52,257 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:55:52,260 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:55:52,262 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:55:52,264 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:55:52,266 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:55:52,270 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:55:52,270 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:55:52,270 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:55:52,271 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:55:52,272 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:55:52,274 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:55:52,274 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:55:52,275 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:55:52,275 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:55:52,276 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:55:52,277 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:55:52,278 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:55:52,278 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:55:52,278 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:55:52,279 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:55:52,281 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:55:52,281 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:55:52,283 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-15 23:55:52,309 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:55:52,309 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:55:52,310 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:55:52,310 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:55:52,310 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:55:52,311 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:55:52,311 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:55:52,311 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:55:52,311 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:55:52,311 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:55:52,311 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:55:52,312 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:55:52,312 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-15 23:55:52,312 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-15 23:55:52,312 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:55:52,312 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:55:52,313 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:55:52,313 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:55:52,313 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:55:52,313 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:55:52,313 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:55:52,313 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:55:52,314 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:55:52,314 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:55:52,314 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:55:52,314 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:55:52,314 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-15 23:55:52,315 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-15 23:55:52,315 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:55:52,315 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-15 23:55:52,315 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_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:52,366 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:55:52,377 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:55:52,380 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:55:52,382 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:55:52,383 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:55:52,383 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-15 23:55:52,436 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/07a604294/31605cc922cc472788fe5482a85a623c/FLAGa22022d20 [2019-11-15 23:55:52,843 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:55:52,845 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-11-15 23:55:52,851 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/07a604294/31605cc922cc472788fe5482a85a623c/FLAGa22022d20 [2019-11-15 23:55:53,205 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/data/07a604294/31605cc922cc472788fe5482a85a623c [2019-11-15 23:55:53,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:55:53,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:55:53,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:53,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:55:53,213 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:55:53,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,224 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ba86f57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53, skipping insertion in model container [2019-11-15 23:55:53,224 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,231 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:55:53,248 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:55:53,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:53,403 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:55:53,428 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:55:53,453 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:55:53,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53 WrapperNode [2019-11-15 23:55:53,453 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:55:53,454 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:53,454 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:55:53,454 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:55:53,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,540 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,584 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:55:53,584 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:55:53,584 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:55:53,584 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:55:53,591 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,595 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,596 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,604 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... [2019-11-15 23:55:53,616 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:55:53,617 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:55:53,617 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:55:53,617 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:55:53,618 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:53,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:55:53,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-15 23:55:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:55:53,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:55:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-15 23:55:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:55:54,161 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:55:54,161 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-15 23:55:54,162 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:54 BoogieIcfgContainer [2019-11-15 23:55:54,162 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:55:54,163 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:55:54,163 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:55:54,166 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:55:54,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:55:53" (1/3) ... [2019-11-15 23:55:54,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbaa1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:54, skipping insertion in model container [2019-11-15 23:55:54,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:55:53" (2/3) ... [2019-11-15 23:55:54,168 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fbaa1d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:55:54, skipping insertion in model container [2019-11-15 23:55:54,168 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:54" (3/3) ... [2019-11-15 23:55:54,170 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-11-15 23:55:54,179 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:55:54,186 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-15 23:55:54,197 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-15 23:55:54,218 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:55:54,218 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:55:54,218 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:55:54,218 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:55:54,218 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:55:54,218 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:55:54,219 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:55:54,219 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:55:54,230 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-15 23:55:54,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-15 23:55:54,237 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:54,238 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:54,240 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:54,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:54,246 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-15 23:55:54,256 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:54,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [130855871] [2019-11-15 23:55:54,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:54,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:54,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-15 23:55:54,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:54,356 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-15 23:55:54,356 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:54,361 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-15 23:55:54,362 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [130855871] [2019-11-15 23:55:54,362 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:54,363 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-15 23:55:54,363 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290371352] [2019-11-15 23:55:54,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-15 23:55:54,372 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:54,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-15 23:55:54,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-15 23:55:54,384 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-15 23:55:54,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:54,401 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-15 23:55:54,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-15 23:55:54,403 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-15 23:55:54,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:54,412 INFO L225 Difference]: With dead ends: 82 [2019-11-15 23:55:54,412 INFO L226 Difference]: Without dead ends: 43 [2019-11-15 23:55:54,416 INFO L600 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-15 23:55:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-15 23:55:54,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-15 23:55:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-15 23:55:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-15 23:55:54,457 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-15 23:55:54,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:54,458 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-15 23:55:54,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-15 23:55:54,458 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-15 23:55:54,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-15 23:55:54,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:54,461 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:54,675 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-15 23:55:54,675 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:54,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-15 23:55:54,676 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:54,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [962532782] [2019-11-15 23:55:54,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:54,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:55:54,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:54,802 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-15 23:55:54,803 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:54,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:54,815 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-15 23:55:54,816 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [962532782] [2019-11-15 23:55:54,816 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:54,817 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-15 23:55:54,817 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532690992] [2019-11-15 23:55:54,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:55:54,820 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:54,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:55:54,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:55:54,821 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-15 23:55:54,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:54,890 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-15 23:55:54,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:55:54,891 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-15 23:55:54,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:54,892 INFO L225 Difference]: With dead ends: 82 [2019-11-15 23:55:54,892 INFO L226 Difference]: Without dead ends: 50 [2019-11-15 23:55:54,893 INFO L600 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-15 23:55:54,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-15 23:55:54,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-15 23:55:54,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-15 23:55:54,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-15 23:55:54,911 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-15 23:55:54,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:54,912 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-15 23:55:54,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:55:54,912 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-15 23:55:54,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-15 23:55:54,914 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:54,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:55:55,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-15 23:55:55,117 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:55,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:55,117 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-15 23:55:55,118 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:55,118 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [10276679] [2019-11-15 23:55:55,118 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:55,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:55,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:55:55,209 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:55,235 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-15 23:55:55,235 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:55,265 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-15 23:55:55,266 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [10276679] [2019-11-15 23:55:55,266 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:55,266 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 23:55:55,266 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972081886] [2019-11-15 23:55:55,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:55,267 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:55,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:55,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:55,268 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-15 23:55:55,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:55,463 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-15 23:55:55,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:55:55,464 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-15 23:55:55,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:55,466 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:55:55,466 INFO L226 Difference]: Without dead ends: 83 [2019-11-15 23:55:55,467 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:55:55,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-15 23:55:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-15 23:55:55,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-15 23:55:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-15 23:55:55,476 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-15 23:55:55,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:55,477 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-15 23:55:55,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:55,477 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-15 23:55:55,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 23:55:55,478 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:55,478 INFO L380 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-15 23:55:55,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-15 23:55:55,691 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:55,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:55,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-15 23:55:55,692 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:55,693 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1467448967] [2019-11-15 23:55:55,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:55,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:55,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:55:55,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:55,783 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:55,822 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:55,860 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-15 23:55:55,860 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:55,862 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:55,910 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:55,935 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-15 23:55:55,935 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1467448967] [2019-11-15 23:55:55,935 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:55,935 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-15 23:55:55,935 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645764797] [2019-11-15 23:55:55,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:55:55,936 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:55,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:55:55,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:55:55,937 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-15 23:55:56,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:56,485 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-11-15 23:55:56,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:55:56,486 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-15 23:55:56,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:56,488 INFO L225 Difference]: With dead ends: 149 [2019-11-15 23:55:56,488 INFO L226 Difference]: Without dead ends: 140 [2019-11-15 23:55:56,489 INFO L600 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-15 23:55:56,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-15 23:55:56,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-11-15 23:55:56,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-15 23:55:56,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-15 23:55:56,506 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-15 23:55:56,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:56,507 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-15 23:55:56,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:55:56,508 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-15 23:55:56,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-15 23:55:56,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:56,510 INFO L380 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-15 23:55:56,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-15 23:55:56,732 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:56,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:56,733 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-15 23:55:56,733 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:56,733 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1916646822] [2019-11-15 23:55:56,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:56,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:56,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:55:56,810 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:56,841 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:56,842 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:56,860 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:56,999 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-15 23:55:57,000 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:57,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:57,118 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:57,147 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-15 23:55:57,147 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1916646822] [2019-11-15 23:55:57,147 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:57,148 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-15 23:55:57,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200545347] [2019-11-15 23:55:57,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:55:57,148 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:57,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:55:57,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:55:57,152 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-15 23:55:57,947 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-11-15 23:55:58,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:58,297 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-15 23:55:58,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:55:58,299 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-15 23:55:58,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:58,301 INFO L225 Difference]: With dead ends: 180 [2019-11-15 23:55:58,301 INFO L226 Difference]: Without dead ends: 178 [2019-11-15 23:55:58,302 INFO L600 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-15 23:55:58,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-15 23:55:58,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-15 23:55:58,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 23:55:58,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-15 23:55:58,317 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-15 23:55:58,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:58,317 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-15 23:55:58,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:55:58,318 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-15 23:55:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-15 23:55:58,319 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:58,319 INFO L380 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-15 23:55:58,540 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-15 23:55:58,540 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:58,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:58,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-15 23:55:58,541 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:58,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1018860432] [2019-11-15 23:55:58,541 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:58,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:55:58,609 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:58,647 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:58,690 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:58,709 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-15 23:55:58,709 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:58,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:58,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:58,736 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:55:58,764 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-15 23:55:58,764 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1018860432] [2019-11-15 23:55:58,765 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:58,765 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-15 23:55:58,765 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542895835] [2019-11-15 23:55:58,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:55:58,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:58,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:55:58,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:55:58,766 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-15 23:55:59,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:59,176 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-15 23:55:59,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:55:59,177 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-15 23:55:59,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:59,177 INFO L225 Difference]: With dead ends: 166 [2019-11-15 23:55:59,178 INFO L226 Difference]: Without dead ends: 131 [2019-11-15 23:55:59,178 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:55:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-15 23:55:59,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-15 23:55:59,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 23:55:59,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-15 23:55:59,196 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-15 23:55:59,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:59,196 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-15 23:55:59,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:55:59,197 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-15 23:55:59,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:55:59,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:59,201 INFO L380 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-15 23:55:59,404 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-15 23:55:59,405 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:59,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:59,405 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-15 23:55:59,405 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:59,405 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1673769936] [2019-11-15 23:55:59,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:59,471 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:55:59,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:59,482 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-15 23:55:59,482 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:59,493 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-15 23:55:59,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1673769936] [2019-11-15 23:55:59,494 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:59,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-15 23:55:59,494 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145564970] [2019-11-15 23:55:59,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:55:59,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:59,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:55:59,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:55:59,495 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-15 23:55:59,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:59,577 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-15 23:55:59,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:55:59,580 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-15 23:55:59,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:59,582 INFO L225 Difference]: With dead ends: 157 [2019-11-15 23:55:59,582 INFO L226 Difference]: Without dead ends: 141 [2019-11-15 23:55:59,582 INFO L600 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-15 23:55:59,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-15 23:55:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-15 23:55:59,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:55:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 23:55:59,599 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-15 23:55:59,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:59,600 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:55:59,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:55:59,601 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-15 23:55:59,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-15 23:55:59,602 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:59,602 INFO L380 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-15 23:55:59,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-15 23:55:59,816 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:55:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:55:59,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-15 23:55:59,817 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:55:59,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1469928572] [2019-11-15 23:55:59,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:55:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:55:59,896 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 23:55:59,897 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:55:59,913 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-15 23:55:59,913 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:55:59,914 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-15 23:55:59,914 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1469928572] [2019-11-15 23:55:59,915 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:55:59,915 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-15 23:55:59,915 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565854390] [2019-11-15 23:55:59,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:55:59,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:55:59,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:55:59,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:55:59,916 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-15 23:55:59,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:55:59,941 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-15 23:55:59,942 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:55:59,942 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-15 23:55:59,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:55:59,943 INFO L225 Difference]: With dead ends: 96 [2019-11-15 23:55:59,943 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 23:55:59,943 INFO L600 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-15 23:55:59,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 23:55:59,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-15 23:55:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 23:55:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-15 23:55:59,951 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-15 23:55:59,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:55:59,951 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-15 23:55:59,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:55:59,951 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-15 23:55:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:55:59,953 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:55:59,953 INFO L380 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-15 23:56:00,154 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-15 23:56:00,154 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:00,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:00,154 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-15 23:56:00,154 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:00,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [414549110] [2019-11-15 23:56:00,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:00,230 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:56:00,232 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:00,248 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:00,275 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:00,297 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-15 23:56:00,297 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:00,299 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:00,337 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:00,360 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-15 23:56:00,360 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [414549110] [2019-11-15 23:56:00,360 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:00,360 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-15 23:56:00,360 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075678850] [2019-11-15 23:56:00,361 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:56:00,361 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:00,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:56:00,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:00,361 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-15 23:56:00,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:00,733 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-15 23:56:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:56:00,734 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-15 23:56:00,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:00,735 INFO L225 Difference]: With dead ends: 131 [2019-11-15 23:56:00,735 INFO L226 Difference]: Without dead ends: 118 [2019-11-15 23:56:00,735 INFO L600 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-15 23:56:00,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-15 23:56:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-15 23:56:00,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-15 23:56:00,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-15 23:56:00,742 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-15 23:56:00,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:00,742 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-15 23:56:00,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:56:00,742 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-15 23:56:00,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:56:00,743 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:00,743 INFO L380 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-15 23:56:00,944 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-15 23:56:00,944 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:00,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:00,944 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-15 23:56:00,945 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:00,945 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1060647588] [2019-11-15 23:56:00,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:01,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-15 23:56:01,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:01,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,045 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,068 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-15 23:56:01,068 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:01,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,073 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,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-15 23:56:01,127 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1060647588] [2019-11-15 23:56:01,127 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:01,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-15 23:56:01,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298242490] [2019-11-15 23:56:01,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-15 23:56:01,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:01,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 23:56:01,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-15 23:56:01,128 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-15 23:56:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:01,463 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-15 23:56:01,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:56:01,463 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-15 23:56:01,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:01,464 INFO L225 Difference]: With dead ends: 114 [2019-11-15 23:56:01,464 INFO L226 Difference]: Without dead ends: 78 [2019-11-15 23:56:01,465 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-15 23:56:01,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-15 23:56:01,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-15 23:56:01,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-15 23:56:01,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-15 23:56:01,470 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-15 23:56:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:01,470 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-15 23:56:01,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-15 23:56:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-15 23:56:01,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-15 23:56:01,471 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:01,471 INFO L380 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-15 23:56:01,680 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-15 23:56:01,681 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:01,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:01,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-15 23:56:01,682 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:01,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [530259962] [2019-11-15 23:56:01,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:01,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:01,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:56:01,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:01,773 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,774 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,804 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,823 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-15 23:56:01,824 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:01,825 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,849 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:01,876 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-15 23:56:01,876 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [530259962] [2019-11-15 23:56:01,876 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:01,877 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-15 23:56:01,877 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954041845] [2019-11-15 23:56:01,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:56:01,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:01,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:56:01,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:56:01,878 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-15 23:56:02,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:02,206 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-15 23:56:02,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:56:02,208 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-15 23:56:02,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:02,209 INFO L225 Difference]: With dead ends: 84 [2019-11-15 23:56:02,209 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 23:56:02,210 INFO L600 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-15 23:56:02,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 23:56:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 23:56:02,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 23:56:02,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-15 23:56:02,215 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-15 23:56:02,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:02,215 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-15 23:56:02,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:56:02,215 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-15 23:56:02,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:56:02,217 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:02,217 INFO L380 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-15 23:56:02,417 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-15 23:56:02,418 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:02,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:02,418 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-15 23:56:02,418 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:02,419 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1615462147] [2019-11-15 23:56:02,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:02,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:02,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 23:56:02,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:02,529 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:02,577 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-15 23:56:02,577 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:02,796 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:02,877 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-15 23:56:02,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1615462147] [2019-11-15 23:56:02,878 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:02,878 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-15 23:56:02,878 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621991285] [2019-11-15 23:56:02,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:56:02,879 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:02,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:56:02,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:02,879 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-15 23:56:03,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:03,200 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-15 23:56:03,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:56:03,201 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-15 23:56:03,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:03,201 INFO L225 Difference]: With dead ends: 82 [2019-11-15 23:56:03,202 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 23:56:03,202 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:56:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 23:56:03,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-15 23:56:03,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-15 23:56:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-15 23:56:03,207 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-15 23:56:03,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:03,208 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-15 23:56:03,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:56:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-15 23:56:03,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 23:56:03,209 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:03,209 INFO L380 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-15 23:56:03,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-15 23:56:03,409 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:03,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:03,410 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-15 23:56:03,410 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:03,410 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2089254852] [2019-11-15 23:56:03,410 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:03,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:03,493 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:56:03,495 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:03,549 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:03,624 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-15 23:56:03,624 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:03,734 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:03,842 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-15 23:56:03,843 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2089254852] [2019-11-15 23:56:03,843 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:03,843 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-15 23:56:03,843 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860074359] [2019-11-15 23:56:03,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:56:03,843 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:56:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:56:03,844 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-15 23:56:08,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:08,375 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2019-11-15 23:56:08,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 23:56:08,375 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-15 23:56:08,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:08,377 INFO L225 Difference]: With dead ends: 224 [2019-11-15 23:56:08,377 INFO L226 Difference]: Without dead ends: 204 [2019-11-15 23:56:08,378 INFO L600 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-15 23:56:08,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-11-15 23:56:08,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 82. [2019-11-15 23:56:08,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-11-15 23:56:08,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-11-15 23:56:08,385 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 26 [2019-11-15 23:56:08,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:08,385 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-11-15 23:56:08,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:56:08,386 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-11-15 23:56:08,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 23:56:08,386 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:08,386 INFO L380 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-15 23:56:08,587 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-15 23:56:08,587 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:08,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:08,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-15 23:56:08,587 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:08,587 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791653105] [2019-11-15 23:56:08,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:08,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:08,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-15 23:56:08,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:08,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:08,667 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:08,681 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:08,953 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-15 23:56:08,958 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-15 23:56:08,958 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:09,105 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:09,133 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:09,156 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-15 23:56:09,156 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791653105] [2019-11-15 23:56:09,156 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:09,156 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-15 23:56:09,156 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025903916] [2019-11-15 23:56:09,157 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-15 23:56:09,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:09,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 23:56:09,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-15 23:56:09,157 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 15 states. [2019-11-15 23:56:11,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:11,802 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2019-11-15 23:56:11,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-11-15 23:56:11,802 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-15 23:56:11,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:11,803 INFO L225 Difference]: With dead ends: 245 [2019-11-15 23:56:11,803 INFO L226 Difference]: Without dead ends: 220 [2019-11-15 23:56:11,805 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2019-11-15 23:56:11,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-11-15 23:56:11,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 72. [2019-11-15 23:56:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-15 23:56:11,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-11-15 23:56:11,814 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 27 [2019-11-15 23:56:11,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:11,814 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-11-15 23:56:11,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-15 23:56:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-11-15 23:56:11,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-15 23:56:11,815 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:11,815 INFO L380 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-15 23:56:12,028 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-15 23:56:12,028 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:12,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:12,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-15 23:56:12,029 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:12,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251353185] [2019-11-15 23:56:12,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:12,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:12,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-15 23:56:12,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:12,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:12,113 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:12,318 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-15 23:56:12,318 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:12,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:12,500 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-15 23:56:12,500 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251353185] [2019-11-15 23:56:12,500 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:12,501 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-15 23:56:12,501 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523027187] [2019-11-15 23:56:12,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:56:12,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:12,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:56:12,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:56:12,502 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 12 states. [2019-11-15 23:56:13,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:13,826 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2019-11-15 23:56:13,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-11-15 23:56:13,826 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-15 23:56:13,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:13,828 INFO L225 Difference]: With dead ends: 187 [2019-11-15 23:56:13,828 INFO L226 Difference]: Without dead ends: 163 [2019-11-15 23:56:13,828 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-11-15 23:56:13,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-11-15 23:56:13,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 70. [2019-11-15 23:56:13,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-11-15 23:56:13,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-11-15 23:56:13,835 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2019-11-15 23:56:13,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:13,835 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-11-15 23:56:13,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:56:13,836 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-11-15 23:56:13,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-15 23:56:13,836 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:13,837 INFO L380 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] [2019-11-15 23:56:14,037 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-15 23:56:14,037 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1881082413, now seen corresponding path program 1 times [2019-11-15 23:56:14,038 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:14,038 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1134936119] [2019-11-15 23:56:14,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:14,137 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 23:56:14,138 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:14,174 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:14,262 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-15 23:56:14,262 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:14,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:14,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-15 23:56:14,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1134936119] [2019-11-15 23:56:14,417 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:14,418 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-15 23:56:14,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981442494] [2019-11-15 23:56:14,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-15 23:56:14,418 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:14,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 23:56:14,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-15 23:56:14,418 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 16 states. [2019-11-15 23:56:16,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:16,967 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-11-15 23:56:16,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:56:16,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-11-15 23:56:16,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:16,969 INFO L225 Difference]: With dead ends: 129 [2019-11-15 23:56:16,969 INFO L226 Difference]: Without dead ends: 91 [2019-11-15 23:56:16,969 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-15 23:56:16,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-11-15 23:56:16,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2019-11-15 23:56:16,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 23:56:16,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-15 23:56:16,972 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 29 [2019-11-15 23:56:16,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:16,972 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-15 23:56:16,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-15 23:56:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-15 23:56:16,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:56:16,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:16,973 INFO L380 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-15 23:56:17,180 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-15 23:56:17,180 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:17,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:17,181 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-15 23:56:17,181 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:17,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1972056650] [2019-11-15 23:56:17,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:17,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:17,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 23:56:17,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:17,288 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:17,289 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:17,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:17,328 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-15 23:56:17,328 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:17,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:17,482 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:17,546 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-15 23:56:17,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1972056650] [2019-11-15 23:56:17,547 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:17,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-15 23:56:17,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047125918] [2019-11-15 23:56:17,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:56:17,547 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:17,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:56:17,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:56:17,548 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-15 23:56:17,949 WARN L191 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-11-15 23:56:18,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:18,242 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-15 23:56:18,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:56:18,242 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-15 23:56:18,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:18,243 INFO L225 Difference]: With dead ends: 52 [2019-11-15 23:56:18,243 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 23:56:18,243 INFO L600 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-15 23:56:18,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 23:56:18,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-15 23:56:18,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 23:56:18,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-15 23:56:18,248 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-15 23:56:18,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:18,250 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-15 23:56:18,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:56:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-15 23:56:18,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 23:56:18,250 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:18,251 INFO L380 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-15 23:56:18,460 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-15 23:56:18,460 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:18,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:18,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-15 23:56:18,461 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:18,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [239259968] [2019-11-15 23:56:18,461 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:18,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:18,548 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-15 23:56:18,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:18,566 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:18,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:18,625 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-15 23:56:18,625 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:18,640 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:18,697 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:18,721 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:18,749 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-15 23:56:18,749 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [239259968] [2019-11-15 23:56:18,749 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:18,749 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-15 23:56:18,749 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124495181] [2019-11-15 23:56:18,750 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-15 23:56:18,750 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:18,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 23:56:18,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-15 23:56:18,750 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-15 23:56:19,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:19,489 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-15 23:56:19,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:56:19,489 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-15 23:56:19,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:19,490 INFO L225 Difference]: With dead ends: 55 [2019-11-15 23:56:19,490 INFO L226 Difference]: Without dead ends: 41 [2019-11-15 23:56:19,490 INFO L600 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-15 23:56:19,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-15 23:56:19,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-15 23:56:19,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:56:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-15 23:56:19,494 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-15 23:56:19,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:19,495 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-15 23:56:19,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-15 23:56:19,495 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-15 23:56:19,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:56:19,495 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:19,495 INFO L380 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-15 23:56:19,696 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-15 23:56:19,696 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:19,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:19,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-15 23:56:19,696 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:19,696 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835030036] [2019-11-15 23:56:19,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/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-15 23:56:19,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:19,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 23:56:19,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:19,808 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:19,885 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-15 23:56:19,885 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:19,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 23:56:19,984 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-15 23:56:19,984 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835030036] [2019-11-15 23:56:19,985 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:19,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-15 23:56:19,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216413812] [2019-11-15 23:56:19,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-15 23:56:19,985 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:19,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 23:56:19,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:56:19,986 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-15 23:56:20,396 WARN L191 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 17 [2019-11-15 23:56:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:20,493 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-15 23:56:20,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 23:56:20,493 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-15 23:56:20,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:20,494 INFO L225 Difference]: With dead ends: 79 [2019-11-15 23:56:20,494 INFO L226 Difference]: Without dead ends: 61 [2019-11-15 23:56:20,494 INFO L600 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-15 23:56:20,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-15 23:56:20,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-15 23:56:20,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-15 23:56:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-15 23:56:20,498 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-15 23:56:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:20,498 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-15 23:56:20,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-15 23:56:20,499 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-15 23:56:20,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 23:56:20,499 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:56:20,499 INFO L380 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-15 23:56:20,704 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-15 23:56:20,704 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:56:20,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:56:20,705 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-15 23:56:20,706 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-11-15 23:56:20,706 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [597831101] [2019-11-15 23:56:20,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-11-15 23:56:20,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:56:20,793 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-15 23:56:20,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 23:56:20,801 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-15 23:56:20,802 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-15 23:56:20,803 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-15 23:56:20,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [597831101] [2019-11-15 23:56:20,803 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:56:20,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-15 23:56:20,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517874640] [2019-11-15 23:56:20,803 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:56:20,804 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-15 23:56:20,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:56:20,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:56:20,804 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-15 23:56:20,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:56:20,821 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-15 23:56:20,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:56:20,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-15 23:56:20,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:56:20,821 INFO L225 Difference]: With dead ends: 39 [2019-11-15 23:56:20,821 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 23:56:20,821 INFO L600 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-15 23:56:20,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 23:56:20,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 23:56:20,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 23:56:20,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 23:56:20,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-15 23:56:20,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:56:20,822 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 23:56:20,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:56:20,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 23:56:20,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 23:56:21,022 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-11-15 23:56:21,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 23:56:21,277 WARN L191 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 84 [2019-11-15 23:56:21,394 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 115 [2019-11-15 23:56:22,494 WARN L191 SmtUtils]: Spent 718.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-11-15 23:56:23,233 WARN L191 SmtUtils]: Spent 737.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 25 [2019-11-15 23:56:23,532 WARN L191 SmtUtils]: Spent 298.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-11-15 23:56:23,786 WARN L191 SmtUtils]: Spent 254.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-11-15 23:56:24,282 WARN L191 SmtUtils]: Spent 494.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 34 [2019-11-15 23:56:24,620 WARN L191 SmtUtils]: Spent 337.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 32 [2019-11-15 23:56:25,349 WARN L191 SmtUtils]: Spent 728.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 36 [2019-11-15 23:56:25,693 WARN L191 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-11-15 23:56:25,873 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-15 23:56:25,953 INFO L446 ceAbstractionStarter]: At program point L85(lines 57 86) the Hoare annotation is: true [2019-11-15 23:56:25,953 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-11-15 23:56:25,953 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 23:56:25,953 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 23:56:25,953 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-11-15 23:56:25,953 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 37 40) no Hoare annotation was computed. [2019-11-15 23:56:25,953 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-11-15 23:56:25,953 INFO L443 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-11-15 23:56:25,953 INFO L439 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-15 23:56:25,953 INFO L439 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-15 23:56:25,953 INFO L439 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-15 23:56:25,954 INFO L439 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-15 23:56:25,954 INFO L439 ceAbstractionStarter]: At program point L55-4(line 55) the Hoare annotation is: (let ((.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))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse3 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse4 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) .cse0 .cse1 (not (fp.eq .cse2 .cse2)) (fp.eq ULTIMATE.start_fmax_float_~x 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))) (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse3 .cse4 (= 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 .cse2) .cse0 .cse3 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse4 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse1))) [2019-11-15 23:56:25,954 INFO L439 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-15 23:56:25,954 INFO L439 ceAbstractionStarter]: At program point L55-6(line 55) the Hoare annotation is: (or (and (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (= ULTIMATE.start_fmax_float_~y 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))) (fp.eq ULTIMATE.start_fmax_float_~x 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))) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) [2019-11-15 23:56:25,954 INFO L439 ceAbstractionStarter]: At program point L55-7(line 55) the Hoare annotation is: (and (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 (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))) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) [2019-11-15 23:56:25,954 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-15 23:56:25,954 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2019-11-15 23:56:25,954 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 40) no Hoare annotation was computed. [2019-11-15 23:56:25,954 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2019-11-15 23:56:25,954 INFO L439 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-15 23:56:25,955 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2019-11-15 23:56:25,955 INFO L443 ceAbstractionStarter]: For program point L23-5(lines 23 27) no Hoare annotation was computed. [2019-11-15 23:56:25,955 INFO L439 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-15 23:56:25,955 INFO L443 ceAbstractionStarter]: For program point L23-7(lines 20 41) no Hoare annotation was computed. [2019-11-15 23:56:25,955 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2019-11-15 23:56:25,955 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-11-15 23:56:25,955 INFO L439 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|)) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1) (= (_ 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-15 23:56:25,955 INFO L439 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-15 23:56:25,956 INFO L443 ceAbstractionStarter]: For program point L73-2(lines 73 76) no Hoare annotation was computed. [2019-11-15 23:56:25,956 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 23:56:25,956 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-11-15 23:56:25,956 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-15 23:56:25,956 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 23:56:25,956 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2019-11-15 23:56:25,956 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 34 40) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L67-5(lines 67 83) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L67-7(lines 67 83) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L439 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)) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.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) .cse3) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (and .cse0 .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-15 23:56:25,957 INFO L443 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-15 23:56:26,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:56:26 BoogieIcfgContainer [2019-11-15 23:56:26,021 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:56:26,022 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:56:26,022 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:56:26,022 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:56:26,023 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:55:54" (3/4) ... [2019-11-15 23:56:26,026 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 23:56:26,043 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-15 23:56:26,048 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-11-15 23:56:26,049 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 23:56:26,070 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-15 23:56:26,070 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-15 23:56:26,071 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-15 23:56:26,071 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-15 23:56:26,072 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-15 23:56:26,072 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) && ~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result) || ((((!~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-11-15 23:56:26,072 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(x, x) && ~fp.eq~FLOAT(\result, x)) && y == y && y == x) && 1bv32 == \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-15 23:56:26,073 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-15 23:56:26,073 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.eq~FLOAT(\result, x) && y == y) && y == 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(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (((((~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-15 23:56:26,073 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-15 23:56:26,074 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-15 23:56:26,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(\result, x) && y == y) && y == 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(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-15 23:56:26,074 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && 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) [2019-11-15 23:56:26,124 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_ce35bb37-47d9-4647-b13a-00b32c43d984/bin/uautomizer/witness.graphml [2019-11-15 23:56:26,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:56:26,126 INFO L168 Benchmark]: Toolchain (without parser) took 32917.57 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.4 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -270.7 MB). Peak memory consumption was 71.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:26,126 INFO L168 Benchmark]: CDTParser took 0.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:56:26,126 INFO L168 Benchmark]: CACSL2BoogieTranslator took 244.73 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:26,127 INFO L168 Benchmark]: Boogie Procedure Inliner took 129.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:26,127 INFO L168 Benchmark]: Boogie Preprocessor took 32.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-15 23:56:26,127 INFO L168 Benchmark]: RCFGBuilder took 545.83 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:26,128 INFO L168 Benchmark]: TraceAbstraction took 31858.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.1 MB). Peak memory consumption was 448.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:26,128 INFO L168 Benchmark]: Witness Printer took 102.62 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-11-15 23:56:26,130 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.31 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 244.73 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 129.94 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.7 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -204.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.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. * RCFGBuilder took 545.83 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: 37.8 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 31858.18 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 186.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -124.1 MB). Peak memory consumption was 448.6 MB. Max. memory is 11.5 GB. * Witness Printer took 102.62 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 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: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: 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(x, x) && ~fp.eq~FLOAT(\result, x)) && y == y && y == x) && 1bv32 == \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: 55]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && 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) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(\result, x) && y == y) && y == 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(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - 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) && ~fp.eq~FLOAT(x, x)) && y == y) && 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(\result, x) && y == y) && y == 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(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (((((~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: 31.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 16.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.9s, HoareTripleCheckerStatistics: 1236 SDtfs, 3202 SDslu, 4894 SDs, 0 SdLazy, 2294 SolverSat, 304 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 10.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 812 SyntacticMatches, 10 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 9.0s 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, 20 MinimizatonAttempts, 754 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 56 NumberOfFragments, 615 HoareAnnotationTreeSize, 14 FomulaSimplifications, 4287102 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 14 FomulaSimplificationsInter, 30084 FormulaSimplificationTreeSizeReductionInter, 4.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.8s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 976 ConstructedInterpolants, 31 QuantifiedInterpolants, 106425 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1458 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 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...