./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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 65a8838494b0fa2a560742eb829642f08a5d8cc8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 11:49:10,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:49:10,948 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:49:10,955 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:49:10,956 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:49:10,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:49:10,958 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:49:10,960 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:49:10,961 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:49:10,962 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:49:10,963 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:49:10,964 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:49:10,964 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:49:10,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:49:10,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:49:10,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:49:10,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:49:10,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:49:10,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:49:10,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:49:10,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:49:10,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:49:10,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:49:10,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:49:10,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:49:10,976 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:49:10,976 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:49:10,977 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:49:10,977 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:49:10,978 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:49:10,978 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:49:10,978 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:49:10,979 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:49:10,979 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:49:10,980 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:49:10,980 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:49:10,981 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:49:10,981 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:49:10,981 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:49:10,982 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:49:10,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:49:10,983 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-07 11:49:10,995 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:49:10,996 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:49:10,997 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:49:10,997 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:49:10,997 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:49:10,997 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:49:10,997 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:49:10,998 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 11:49:10,998 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:49:10,998 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:49:10,998 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:49:10,998 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:49:10,998 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:49:10,999 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:49:10,999 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:49:10,999 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:49:10,999 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:49:10,999 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:49:11,000 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:49:11,000 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:49:11,000 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:49:11,000 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:49:11,000 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:49:11,001 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:49:11,001 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:49:11,001 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-07 11:49:11,001 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 11:49:11,001 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:49:11,002 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:49:11,002 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_8e961cd3-2ad4-4533-9427-5878ba7b0144/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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-12-07 11:49:11,109 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:49:11,118 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:49:11,121 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:49:11,122 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:49:11,122 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:49:11,122 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-12-07 11:49:11,160 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/ab356a02f/1adda3aab71c4bb08101ab83df467553/FLAG263c942bf [2019-12-07 11:49:11,468 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:49:11,469 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-12-07 11:49:11,473 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/ab356a02f/1adda3aab71c4bb08101ab83df467553/FLAG263c942bf [2019-12-07 11:49:11,482 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/ab356a02f/1adda3aab71c4bb08101ab83df467553 [2019-12-07 11:49:11,484 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:49:11,484 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:49:11,485 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:11,485 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:49:11,488 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:49:11,488 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,490 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c5feb34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11, skipping insertion in model container [2019-12-07 11:49:11,490 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,495 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:49:11,508 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:49:11,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:11,648 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:49:11,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:11,680 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:49:11,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11 WrapperNode [2019-12-07 11:49:11,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:11,681 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:49:11,681 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:49:11,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:49:11,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,693 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,711 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:49:11,711 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:49:11,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:49:11,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:49:11,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,719 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,719 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,725 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,728 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,730 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... [2019-12-07 11:49:11,732 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:49:11,732 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:49:11,732 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:49:11,732 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:49:11,733 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:11,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:49:11,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-12-07 11:49:11,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:49:11,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:49:11,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-07 11:49:11,772 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:49:11,996 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:49:11,996 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 11:49:11,997 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:11 BoogieIcfgContainer [2019-12-07 11:49:11,997 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:49:11,998 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:49:11,998 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:49:12,000 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:49:12,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:49:11" (1/3) ... [2019-12-07 11:49:12,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2984d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:12, skipping insertion in model container [2019-12-07 11:49:12,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:11" (2/3) ... [2019-12-07 11:49:12,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2984d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:12, skipping insertion in model container [2019-12-07 11:49:12,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:11" (3/3) ... [2019-12-07 11:49:12,002 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-12-07 11:49:12,008 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:49:12,012 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:49:12,019 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 11:49:12,034 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:49:12,034 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:49:12,034 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:49:12,034 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:49:12,034 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:49:12,034 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:49:12,034 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:49:12,034 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:49:12,044 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-12-07 11:49:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:49:12,048 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:12,049 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:12,049 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:12,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:12,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-12-07 11:49:12,058 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:12,058 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582398237] [2019-12-07 11:49:12,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:12,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:12,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:12,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582398237] [2019-12-07 11:49:12,156 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:12,156 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:49:12,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696515312] [2019-12-07 11:49:12,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:12,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:12,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:12,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:12,169 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-12-07 11:49:12,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:12,215 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-12-07 11:49:12,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:49:12,217 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-07 11:49:12,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:12,224 INFO L225 Difference]: With dead ends: 90 [2019-12-07 11:49:12,224 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 11:49:12,226 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 11:49:12,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-12-07 11:49:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:49:12,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-12-07 11:49:12,251 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-12-07 11:49:12,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:12,251 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 11:49:12,252 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-12-07 11:49:12,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:49:12,252 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:12,252 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:12,253 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:12,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:12,253 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-12-07 11:49:12,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:12,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982940576] [2019-12-07 11:49:12,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:12,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:12,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-12-07 11:49:12,297 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982940576] [2019-12-07 11:49:12,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:12,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 11:49:12,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730735993] [2019-12-07 11:49:12,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:12,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:12,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:12,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:12,300 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-12-07 11:49:12,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:12,334 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-12-07 11:49:12,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:12,334 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-12-07 11:49:12,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:12,335 INFO L225 Difference]: With dead ends: 77 [2019-12-07 11:49:12,336 INFO L226 Difference]: Without dead ends: 64 [2019-12-07 11:49:12,336 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:12,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-12-07 11:49:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-12-07 11:49:12,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 11:49:12,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-12-07 11:49:12,343 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-12-07 11:49:12,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:12,344 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-07 11:49:12,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:12,344 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-12-07 11:49:12,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:49:12,345 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:12,345 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:12,345 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:12,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:12,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-12-07 11:49:12,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:12,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349328964] [2019-12-07 11:49:12,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:12,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:12,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:12,382 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349328964] [2019-12-07 11:49:12,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:12,382 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-07 11:49:12,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419005597] [2019-12-07 11:49:12,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:49:12,383 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-07 11:49:12,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:49:12,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:12,383 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-12-07 11:49:12,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:12,393 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-12-07 11:49:12,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:49:12,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-12-07 11:49:12,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:12,394 INFO L225 Difference]: With dead ends: 50 [2019-12-07 11:49:12,394 INFO L226 Difference]: Without dead ends: 48 [2019-12-07 11:49:12,394 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:12,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-12-07 11:49:12,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-12-07 11:49:12,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-12-07 11:49:12,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-12-07 11:49:12,398 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-12-07 11:49:12,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:12,398 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-12-07 11:49:12,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:49:12,399 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-12-07 11:49:12,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:49:12,399 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:12,399 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:12,399 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:12,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:12,400 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-12-07 11:49:12,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-07 11:49:12,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299310506] [2019-12-07 11:49:12,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 11:49:12,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:49:12,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 11:49:12,460 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-07 11:49:12,460 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 11:49:12,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:49:12 BoogieIcfgContainer [2019-12-07 11:49:12,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:49:12,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:49:12,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:49:12,482 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:49:12,482 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:11" (3/4) ... [2019-12-07 11:49:12,484 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 11:49:12,484 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:49:12,486 INFO L168 Benchmark]: Toolchain (without parser) took 1000.93 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 942.5 MB in the beginning and 1.0 GB in the end (delta: -73.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,486 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:12,487 INFO L168 Benchmark]: CACSL2BoogieTranslator took 195.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,487 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.64 ms. Allocated memory is still 1.1 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-12-07 11:49:12,487 INFO L168 Benchmark]: Boogie Preprocessor took 21.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:12,488 INFO L168 Benchmark]: RCFGBuilder took 265.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,488 INFO L168 Benchmark]: TraceAbstraction took 483.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:12,488 INFO L168 Benchmark]: Witness Printer took 3.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:12,491 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.17 ms. Allocated memory is still 1.0 GB. Free memory is still 958.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 195.62 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 109.1 MB). Free memory was 942.5 MB in the beginning and 1.1 GB in the end (delta: -160.5 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.64 ms. Allocated memory is still 1.1 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 21.08 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 265.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 483.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 54.8 MB). Peak memory consumption was 54.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.02 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 75]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 74. Possible FailurePath: [L66] float x = __VERIFIER_nondet_float(); [L67] float y = __VERIFIER_nondet_float(); [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L68] EXPR isnan_float(x) && !isnan_float(y) [L68-L69] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L68-L69] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L13] __uint32_t w; [L16] ieee_float_shape_type gf_u; [L17] gf_u.value = (x) [L18] EXPR gf_u.word [L18] (w) = gf_u.word [L21] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L23-L24] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L26-L27] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L29] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L32] return 0; [L36] COND TRUE __fpclassify_float(x) == 0 [L37] return y; [L71] float res = fmin_float(x, y); [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L57] return x != x; [L74] EXPR isnan_float(x) && !isnan_float(y) [L74] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L75] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.4s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, 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.0s SatisfiabilityAnalysisTime, 0.0s 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.25-f470102 [2019-12-07 11:49:13,944 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 11:49:13,945 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 11:49:13,954 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 11:49:13,955 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 11:49:13,956 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 11:49:13,957 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 11:49:13,958 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 11:49:13,960 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 11:49:13,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 11:49:13,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 11:49:13,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 11:49:13,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 11:49:13,964 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 11:49:13,965 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 11:49:13,966 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 11:49:13,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 11:49:13,968 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 11:49:13,969 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 11:49:13,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 11:49:13,973 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 11:49:13,974 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 11:49:13,975 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 11:49:13,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 11:49:13,978 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 11:49:13,978 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 11:49:13,978 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 11:49:13,979 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 11:49:13,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 11:49:13,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 11:49:13,981 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 11:49:13,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 11:49:13,981 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 11:49:13,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 11:49:13,983 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 11:49:13,983 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 11:49:13,984 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 11:49:13,984 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 11:49:13,984 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 11:49:13,985 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 11:49:13,985 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 11:49:13,986 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-12-07 11:49:13,998 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 11:49:13,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 11:49:13,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 11:49:13,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 11:49:14,000 INFO L138 SettingsManager]: * Use SBE=true [2019-12-07 11:49:14,000 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 11:49:14,000 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 11:49:14,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 11:49:14,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 11:49:14,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-07 11:49:14,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 11:49:14,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-07 11:49:14,001 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 11:49:14,001 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 11:49:14,001 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 11:49:14,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-07 11:49:14,002 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 11:49:14,002 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-07 11:49:14,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 11:49:14,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 11:49:14,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 11:49:14,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 11:49:14,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 11:49:14,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 11:49:14,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 11:49:14,003 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-07 11:49:14,003 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-12-07 11:49:14,003 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 11:49:14,003 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-07 11:49:14,003 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 11:49:14,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 11:49:14,004 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_8e961cd3-2ad4-4533-9427-5878ba7b0144/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 -> 65a8838494b0fa2a560742eb829642f08a5d8cc8 [2019-12-07 11:49:14,165 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 11:49:14,173 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 11:49:14,175 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 11:49:14,176 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 11:49:14,176 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 11:49:14,177 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-12-07 11:49:14,214 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/4aaedf49d/ed4ed858bbb24e00b139ad0e1294e907/FLAGd82d08b83 [2019-12-07 11:49:14,590 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 11:49:14,591 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-12-07 11:49:14,595 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/4aaedf49d/ed4ed858bbb24e00b139ad0e1294e907/FLAGd82d08b83 [2019-12-07 11:49:14,990 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/data/4aaedf49d/ed4ed858bbb24e00b139ad0e1294e907 [2019-12-07 11:49:14,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 11:49:14,993 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 11:49:14,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:14,994 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 11:49:14,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 11:49:14,996 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:14" (1/1) ... [2019-12-07 11:49:14,998 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@197b78eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:14, skipping insertion in model container [2019-12-07 11:49:14,998 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 11:49:14" (1/1) ... [2019-12-07 11:49:15,003 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 11:49:15,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 11:49:15,121 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:15,124 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 11:49:15,142 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 11:49:15,158 INFO L208 MainTranslator]: Completed translation [2019-12-07 11:49:15,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15 WrapperNode [2019-12-07 11:49:15,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 11:49:15,159 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 11:49:15,159 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 11:49:15,159 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 11:49:15,164 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,219 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 11:49:15,219 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 11:49:15,219 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 11:49:15,219 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 11:49:15,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,229 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,236 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,239 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,241 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... [2019-12-07 11:49:15,244 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 11:49:15,244 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 11:49:15,244 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 11:49:15,244 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 11:49:15,245 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 11:49:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-07 11:49:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 11:49:15,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 11:49:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-12-07 11:49:15,284 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 11:49:15,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 11:49:15,530 INFO L287 CfgBuilder]: Removed 30 assume(true) statements. [2019-12-07 11:49:15,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:15 BoogieIcfgContainer [2019-12-07 11:49:15,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 11:49:15,532 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 11:49:15,532 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 11:49:15,534 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 11:49:15,534 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 11:49:14" (1/3) ... [2019-12-07 11:49:15,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18927542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:15, skipping insertion in model container [2019-12-07 11:49:15,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 11:49:15" (2/3) ... [2019-12-07 11:49:15,535 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18927542 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 11:49:15, skipping insertion in model container [2019-12-07 11:49:15,535 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:15" (3/3) ... [2019-12-07 11:49:15,536 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-12-07 11:49:15,542 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 11:49:15,546 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-07 11:49:15,553 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-12-07 11:49:15,568 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 11:49:15,568 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-07 11:49:15,568 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 11:49:15,568 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 11:49:15,568 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 11:49:15,568 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 11:49:15,568 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 11:49:15,568 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 11:49:15,577 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-12-07 11:49:15,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-07 11:49:15,582 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:15,582 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:15,582 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:15,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:15,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-12-07 11:49:15,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:15,593 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1571164808] [2019-12-07 11:49:15,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:15,646 INFO L264 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2019-12-07 11:49:15,649 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:15,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:15,659 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:15,663 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1571164808] [2019-12-07 11:49:15,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:15,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 11:49:15,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306091005] [2019-12-07 11:49:15,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-07 11:49:15,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:15,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-07 11:49:15,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:49:15,678 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-12-07 11:49:15,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:15,692 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-12-07 11:49:15,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-07 11:49:15,693 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-12-07 11:49:15,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:15,700 INFO L225 Difference]: With dead ends: 82 [2019-12-07 11:49:15,700 INFO L226 Difference]: Without dead ends: 43 [2019-12-07 11:49:15,703 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-07 11:49:15,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-12-07 11:49:15,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-12-07 11:49:15,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 11:49:15,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-12-07 11:49:15,727 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-12-07 11:49:15,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:15,728 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-12-07 11:49:15,728 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-07 11:49:15,728 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-12-07 11:49:15,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-07 11:49:15,728 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:15,728 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:15,929 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 11:49:15,930 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:15,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:15,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-12-07 11:49:15,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:15,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [700038266] [2019-12-07 11:49:15,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:16,073 INFO L264 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:49:16,075 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:16,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:16,092 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:16,096 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:16,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:16,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [700038266] [2019-12-07 11:49:16,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:16,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:49:16,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302771253] [2019-12-07 11:49:16,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:16,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:16,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:16,102 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:16,102 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-12-07 11:49:16,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:16,146 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-12-07 11:49:16,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 11:49:16,146 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-07 11:49:16,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:16,147 INFO L225 Difference]: With dead ends: 82 [2019-12-07 11:49:16,147 INFO L226 Difference]: Without dead ends: 50 [2019-12-07 11:49:16,148 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:16,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-12-07 11:49:16,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-12-07 11:49:16,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-12-07 11:49:16,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-12-07 11:49:16,153 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-12-07 11:49:16,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:16,153 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-12-07 11:49:16,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:16,154 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-12-07 11:49:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-07 11:49:16,154 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:16,154 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:16,355 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 11:49:16,356 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:16,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:16,357 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-12-07 11:49:16,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:16,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2108713994] [2019-12-07 11:49:16,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:16,503 INFO L264 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:49:16,504 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:16,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:16,517 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:16,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:16,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2108713994] [2019-12-07 11:49:16,532 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:16,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:49:16,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622648499] [2019-12-07 11:49:16,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:49:16,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:16,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:49:16,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:49:16,533 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-12-07 11:49:16,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:16,606 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-12-07 11:49:16,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:49:16,606 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-12-07 11:49:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:16,607 INFO L225 Difference]: With dead ends: 96 [2019-12-07 11:49:16,607 INFO L226 Difference]: Without dead ends: 83 [2019-12-07 11:49:16,608 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:16,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-12-07 11:49:16,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-12-07 11:49:16,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-12-07 11:49:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-12-07 11:49:16,613 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-12-07 11:49:16,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:16,613 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-12-07 11:49:16,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:49:16,613 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-12-07 11:49:16,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-07 11:49:16,614 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:16,614 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:16,815 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 11:49:16,816 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:16,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-12-07 11:49:16,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:16,818 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1289985725] [2019-12-07 11:49:16,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:16,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:16,956 INFO L264 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:49:16,957 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:16,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:16,981 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:17,005 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:17,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:17,027 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:17,028 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:17,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:17,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:17,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1289985725] [2019-12-07 11:49:17,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:17,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-12-07 11:49:17,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988404018] [2019-12-07 11:49:17,074 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:49:17,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:17,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:49:17,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:49:17,075 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-12-07 11:49:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:19,439 INFO L93 Difference]: Finished difference Result 146 states and 194 transitions. [2019-12-07 11:49:19,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:49:19,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-12-07 11:49:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:19,441 INFO L225 Difference]: With dead ends: 146 [2019-12-07 11:49:19,441 INFO L226 Difference]: Without dead ends: 137 [2019-12-07 11:49:19,442 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:49:19,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2019-12-07 11:49:19,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 75. [2019-12-07 11:49:19,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-12-07 11:49:19,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-12-07 11:49:19,450 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-12-07 11:49:19,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:19,451 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-12-07 11:49:19,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:49:19,451 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-12-07 11:49:19,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-07 11:49:19,452 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:19,452 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:19,653 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 11:49:19,654 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:19,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:19,655 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-12-07 11:49:19,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:19,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1880497658] [2019-12-07 11:49:19,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:19,730 INFO L264 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:49:19,731 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:19,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:19,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:19,757 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:19,884 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:19,884 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:19,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:19,952 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:19,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:19,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1880497658] [2019-12-07 11:49:19,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:19,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-12-07 11:49:19,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892389838] [2019-12-07 11:49:19,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:49:19,968 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:19,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:49:19,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:49:19,968 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-12-07 11:49:21,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:21,550 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-12-07 11:49:21,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-07 11:49:21,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-12-07 11:49:21,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:21,552 INFO L225 Difference]: With dead ends: 180 [2019-12-07 11:49:21,552 INFO L226 Difference]: Without dead ends: 178 [2019-12-07 11:49:21,553 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-12-07 11:49:21,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-12-07 11:49:21,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-12-07 11:49:21,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 11:49:21,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-12-07 11:49:21,563 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-12-07 11:49:21,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:21,563 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-12-07 11:49:21,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:49:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-12-07 11:49:21,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-07 11:49:21,564 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:21,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:21,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 11:49:21,765 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:21,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:21,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-12-07 11:49:21,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:21,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [573342198] [2019-12-07 11:49:21,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:21,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:21,861 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:49:21,862 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:21,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:21,885 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:21,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:21,916 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:21,918 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:21,919 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:21,929 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:21,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:21,943 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [573342198] [2019-12-07 11:49:21,943 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:21,943 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-07 11:49:21,943 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745947465] [2019-12-07 11:49:21,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:49:21,944 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:21,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:49:21,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:49:21,944 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-12-07 11:49:22,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:22,251 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-12-07 11:49:22,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:49:22,252 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-12-07 11:49:22,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:22,253 INFO L225 Difference]: With dead ends: 166 [2019-12-07 11:49:22,253 INFO L226 Difference]: Without dead ends: 131 [2019-12-07 11:49:22,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:49:22,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-12-07 11:49:22,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-12-07 11:49:22,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 11:49:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-12-07 11:49:22,260 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-12-07 11:49:22,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:22,260 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-12-07 11:49:22,260 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:49:22,260 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-12-07 11:49:22,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:49:22,261 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:22,261 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:22,462 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 11:49:22,462 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:22,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:22,463 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-12-07 11:49:22,464 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:22,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392873722] [2019-12-07 11:49:22,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:22,584 INFO L264 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:49:22,585 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:22,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:22,594 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:22,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:22,603 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392873722] [2019-12-07 11:49:22,603 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:22,604 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-12-07 11:49:22,604 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446889816] [2019-12-07 11:49:22,604 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 11:49:22,604 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:22,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 11:49:22,605 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-07 11:49:22,605 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-12-07 11:49:22,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:22,655 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-12-07 11:49:22,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 11:49:22,656 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-07 11:49:22,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:22,656 INFO L225 Difference]: With dead ends: 157 [2019-12-07 11:49:22,657 INFO L226 Difference]: Without dead ends: 141 [2019-12-07 11:49:22,657 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 11:49:22,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-12-07 11:49:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-12-07 11:49:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 11:49:22,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-12-07 11:49:22,666 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-12-07 11:49:22,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:22,667 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-12-07 11:49:22,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 11:49:22,667 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-12-07 11:49:22,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-07 11:49:22,668 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:22,668 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:22,869 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 11:49:22,870 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:22,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:22,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-12-07 11:49:22,871 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:22,872 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1874754153] [2019-12-07 11:49:22,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:22,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:22,952 INFO L264 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2019-12-07 11:49:22,953 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:22,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:22,956 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:22,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:22,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1874754153] [2019-12-07 11:49:22,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:22,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-12-07 11:49:22,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113797633] [2019-12-07 11:49:22,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 11:49:22,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:22,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 11:49:22,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:22,958 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-12-07 11:49:22,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:22,978 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-12-07 11:49:22,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 11:49:22,978 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-12-07 11:49:22,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:22,979 INFO L225 Difference]: With dead ends: 96 [2019-12-07 11:49:22,979 INFO L226 Difference]: Without dead ends: 94 [2019-12-07 11:49:22,980 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 11:49:22,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-12-07 11:49:22,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-12-07 11:49:22,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-12-07 11:49:22,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-12-07 11:49:22,985 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-12-07 11:49:22,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:22,986 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-12-07 11:49:22,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 11:49:22,986 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-12-07 11:49:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:49:22,987 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:22,987 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:23,187 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 11:49:23,188 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:23,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:23,189 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-12-07 11:49:23,190 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:23,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388290544] [2019-12-07 11:49:23,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:23,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:23,281 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:49:23,282 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:23,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:23,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:23,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:23,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-12-07 11:49:23,328 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:23,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:23,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:23,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:23,363 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388290544] [2019-12-07 11:49:23,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:23,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-12-07 11:49:23,364 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575084460] [2019-12-07 11:49:23,364 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:49:23,364 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:23,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:49:23,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:49:23,364 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-12-07 11:49:23,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:23,641 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-12-07 11:49:23,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-07 11:49:23,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-12-07 11:49:23,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:23,642 INFO L225 Difference]: With dead ends: 131 [2019-12-07 11:49:23,642 INFO L226 Difference]: Without dead ends: 118 [2019-12-07 11:49:23,642 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:49:23,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-12-07 11:49:23,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-12-07 11:49:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-12-07 11:49:23,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-12-07 11:49:23,647 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-12-07 11:49:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:23,647 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-12-07 11:49:23,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:49:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-12-07 11:49:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:49:23,648 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:23,648 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:23,849 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 11:49:23,850 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:23,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:23,850 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-12-07 11:49:23,851 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:23,852 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1617522719] [2019-12-07 11:49:23,852 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:23,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:23,966 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjunts are in the unsatisfiable core [2019-12-07 11:49:23,967 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:23,978 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:23,979 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:23,994 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:24,015 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:24,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,018 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,040 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:24,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1617522719] [2019-12-07 11:49:24,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:24,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-12-07 11:49:24,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896398962] [2019-12-07 11:49:24,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-07 11:49:24,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:24,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-07 11:49:24,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-07 11:49:24,054 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-12-07 11:49:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:24,336 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-12-07 11:49:24,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:49:24,336 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-12-07 11:49:24,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:24,337 INFO L225 Difference]: With dead ends: 114 [2019-12-07 11:49:24,337 INFO L226 Difference]: Without dead ends: 78 [2019-12-07 11:49:24,338 INFO L630 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-12-07 11:49:24,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-12-07 11:49:24,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-12-07 11:49:24,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-12-07 11:49:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-12-07 11:49:24,342 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-12-07 11:49:24,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:24,343 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-12-07 11:49:24,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-07 11:49:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-12-07 11:49:24,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-07 11:49:24,343 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:24,344 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:24,544 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-12-07 11:49:24,545 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:24,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:24,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-12-07 11:49:24,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:24,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1773199649] [2019-12-07 11:49:24,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:24,626 INFO L264 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:49:24,627 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,639 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,656 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:24,668 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:24,669 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,671 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:24,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:24,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1773199649] [2019-12-07 11:49:24,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:24,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-12-07 11:49:24,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117253982] [2019-12-07 11:49:24,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 11:49:24,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:24,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 11:49:24,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-07 11:49:24,700 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-12-07 11:49:24,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:24,883 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-12-07 11:49:24,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:49:24,883 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-12-07 11:49:24,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:24,884 INFO L225 Difference]: With dead ends: 84 [2019-12-07 11:49:24,884 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 11:49:24,884 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-12-07 11:49:24,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 11:49:24,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 11:49:24,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 11:49:24,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-12-07 11:49:24,887 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-12-07 11:49:24,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:24,888 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-12-07 11:49:24,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 11:49:24,888 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-12-07 11:49:24,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:49:24,888 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:24,888 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:25,089 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-12-07 11:49:25,090 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:25,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:25,090 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-12-07 11:49:25,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:25,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1066536252] [2019-12-07 11:49:25,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:25,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:25,183 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 9 conjunts are in the unsatisfiable core [2019-12-07 11:49:25,184 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:25,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:25,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:25,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:25,222 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:25,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:25,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:25,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1066536252] [2019-12-07 11:49:25,476 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:25,476 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 11:49:25,476 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377199331] [2019-12-07 11:49:25,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:49:25,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:25,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:49:25,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:49:25,477 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-12-07 11:49:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:25,736 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-12-07 11:49:25,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-07 11:49:25,736 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-12-07 11:49:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:25,737 INFO L225 Difference]: With dead ends: 82 [2019-12-07 11:49:25,737 INFO L226 Difference]: Without dead ends: 74 [2019-12-07 11:49:25,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:49:25,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-12-07 11:49:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-12-07 11:49:25,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-12-07 11:49:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-12-07 11:49:25,742 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-12-07 11:49:25,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:25,742 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-12-07 11:49:25,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:49:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-12-07 11:49:25,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-07 11:49:25,743 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:25,743 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:25,943 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-12-07 11:49:25,945 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:25,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:25,946 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-12-07 11:49:25,946 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:25,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652296248] [2019-12-07 11:49:25,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:26,041 INFO L264 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 12 conjunts are in the unsatisfiable core [2019-12-07 11:49:26,043 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:26,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:26,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:26,140 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:26,236 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:26,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:26,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652296248] [2019-12-07 11:49:26,309 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:26,309 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-12-07 11:49:26,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906113685] [2019-12-07 11:49:26,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-07 11:49:26,309 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:26,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-07 11:49:26,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-12-07 11:49:26,310 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-12-07 11:49:27,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:27,737 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-12-07 11:49:27,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-07 11:49:27,737 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-12-07 11:49:27,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:27,738 INFO L225 Difference]: With dead ends: 154 [2019-12-07 11:49:27,738 INFO L226 Difference]: Without dead ends: 134 [2019-12-07 11:49:27,738 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 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-12-07 11:49:27,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-12-07 11:49:27,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-12-07 11:49:27,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-12-07 11:49:27,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-12-07 11:49:27,744 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-12-07 11:49:27,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:27,744 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-12-07 11:49:27,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-07 11:49:27,745 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-12-07 11:49:27,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-07 11:49:27,745 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:27,745 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:27,945 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-12-07 11:49:27,946 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-12-07 11:49:27,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:27,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [183435211] [2019-12-07 11:49:27,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:28,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:28,072 INFO L264 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 22 conjunts are in the unsatisfiable core [2019-12-07 11:49:28,074 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:28,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:28,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:28,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:28,309 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:28,309 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:28,437 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:28,453 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:28,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [183435211] [2019-12-07 11:49:28,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:28,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-12-07 11:49:28,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598952051] [2019-12-07 11:49:28,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-07 11:49:28,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:28,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-07 11:49:28,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-07 11:49:28,474 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-12-07 11:49:31,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:31,202 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-12-07 11:49:31,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-07 11:49:31,202 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-12-07 11:49:31,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:31,203 INFO L225 Difference]: With dead ends: 195 [2019-12-07 11:49:31,203 INFO L226 Difference]: Without dead ends: 158 [2019-12-07 11:49:31,204 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-12-07 11:49:31,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-12-07 11:49:31,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-12-07 11:49:31,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-12-07 11:49:31,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-12-07 11:49:31,208 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-12-07 11:49:31,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:31,208 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-12-07 11:49:31,208 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-07 11:49:31,208 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-12-07 11:49:31,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-07 11:49:31,208 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:31,208 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:31,409 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-12-07 11:49:31,410 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:31,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:31,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-12-07 11:49:31,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:31,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [829030459] [2019-12-07 11:49:31,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:31,504 INFO L264 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 21 conjunts are in the unsatisfiable core [2019-12-07 11:49:31,505 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:31,516 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:31,517 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:31,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:31,695 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:31,809 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:31,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:31,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [829030459] [2019-12-07 11:49:31,830 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:31,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-12-07 11:49:31,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677183847] [2019-12-07 11:49:31,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:49:31,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:31,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:49:31,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:49:31,832 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-12-07 11:49:32,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:32,685 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-12-07 11:49:32,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-07 11:49:32,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-12-07 11:49:32,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:32,686 INFO L225 Difference]: With dead ends: 125 [2019-12-07 11:49:32,686 INFO L226 Difference]: Without dead ends: 101 [2019-12-07 11:49:32,686 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-12-07 11:49:32,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-12-07 11:49:32,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-12-07 11:49:32,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 11:49:32,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-12-07 11:49:32,690 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-12-07 11:49:32,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:32,690 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-12-07 11:49:32,690 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:49:32,690 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-12-07 11:49:32,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 11:49:32,690 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:32,690 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:32,891 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-12-07 11:49:32,891 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:32,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:32,892 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-12-07 11:49:32,893 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:32,893 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169242160] [2019-12-07 11:49:32,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:33,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:33,008 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-12-07 11:49:33,009 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:33,021 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:33,031 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:33,051 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:33,166 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:33,200 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:33,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:33,249 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169242160] [2019-12-07 11:49:33,249 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:33,249 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-12-07 11:49:33,249 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480743241] [2019-12-07 11:49:33,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 11:49:33,249 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:33,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 11:49:33,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-07 11:49:33,250 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-12-07 11:49:35,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:35,637 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-12-07 11:49:35,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 11:49:35,637 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-12-07 11:49:35,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:35,638 INFO L225 Difference]: With dead ends: 52 [2019-12-07 11:49:35,638 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:49:35,638 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:49:35,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:49:35,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-12-07 11:49:35,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-12-07 11:49:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-12-07 11:49:35,643 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-12-07 11:49:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:35,643 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-12-07 11:49:35,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 11:49:35,643 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-12-07 11:49:35,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-07 11:49:35,643 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:35,644 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:35,844 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-12-07 11:49:35,845 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:35,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-12-07 11:49:35,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:35,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103390158] [2019-12-07 11:49:35,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:35,934 INFO L264 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 15 conjunts are in the unsatisfiable core [2019-12-07 11:49:35,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:35,948 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:35,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:35,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:35,997 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:36,010 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:36,059 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:36,077 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:36,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:36,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103390158] [2019-12-07 11:49:36,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:36,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-12-07 11:49:36,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048441714] [2019-12-07 11:49:36,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-07 11:49:36,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:36,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-07 11:49:36,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-12-07 11:49:36,103 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-12-07 11:49:36,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:36,604 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-12-07 11:49:36,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 11:49:36,604 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-12-07 11:49:36,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:36,605 INFO L225 Difference]: With dead ends: 55 [2019-12-07 11:49:36,605 INFO L226 Difference]: Without dead ends: 41 [2019-12-07 11:49:36,605 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-12-07 11:49:36,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-12-07 11:49:36,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-12-07 11:49:36,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 11:49:36,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-12-07 11:49:36,608 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-12-07 11:49:36,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:36,608 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-12-07 11:49:36,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-07 11:49:36,608 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-12-07 11:49:36,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-07 11:49:36,608 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:36,608 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:36,809 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-12-07 11:49:36,809 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:36,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:36,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-12-07 11:49:36,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:36,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2095135364] [2019-12-07 11:49:36,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:36,935 INFO L264 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 11:49:36,936 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:36,977 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:37,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:37,027 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:37,095 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 11:49:37,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:37,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2095135364] [2019-12-07 11:49:37,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:37,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-12-07 11:49:37,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571879274] [2019-12-07 11:49:37,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-07 11:49:37,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:37,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-07 11:49:37,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-12-07 11:49:37,130 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-12-07 11:49:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:37,691 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-12-07 11:49:37,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 11:49:37,691 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-12-07 11:49:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:37,691 INFO L225 Difference]: With dead ends: 79 [2019-12-07 11:49:37,691 INFO L226 Difference]: Without dead ends: 61 [2019-12-07 11:49:37,692 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-07 11:49:37,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-12-07 11:49:37,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-12-07 11:49:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-12-07 11:49:37,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-12-07 11:49:37,695 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-12-07 11:49:37,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:37,695 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-12-07 11:49:37,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-07 11:49:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-12-07 11:49:37,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-07 11:49:37,695 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 11:49:37,696 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 11:49:37,896 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-12-07 11:49:37,897 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-07 11:49:37,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 11:49:37,898 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-12-07 11:49:37,898 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-12-07 11:49:37,899 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1660676802] [2019-12-07 11:49:37,899 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/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-12-07 11:49:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 11:49:38,030 INFO L264 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 3 conjunts are in the unsatisfiable core [2019-12-07 11:49:38,030 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 11:49:38,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:38,037 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 11:49:38,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 11:49:38,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1660676802] [2019-12-07 11:49:38,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 11:49:38,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 11:49:38,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11694123] [2019-12-07 11:49:38,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 11:49:38,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-12-07 11:49:38,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 11:49:38,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 11:49:38,039 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-12-07 11:49:38,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 11:49:38,062 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-12-07 11:49:38,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 11:49:38,063 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-07 11:49:38,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 11:49:38,063 INFO L225 Difference]: With dead ends: 39 [2019-12-07 11:49:38,063 INFO L226 Difference]: Without dead ends: 0 [2019-12-07 11:49:38,063 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 11:49:38,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-12-07 11:49:38,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-12-07 11:49:38,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-12-07 11:49:38,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-12-07 11:49:38,064 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-12-07 11:49:38,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 11:49:38,064 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-12-07 11:49:38,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 11:49:38,064 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-12-07 11:49:38,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-12-07 11:49:38,264 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-12-07 11:49:38,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-12-07 11:49:38,413 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 87 [2019-12-07 11:49:39,085 WARN L192 SmtUtils]: Spent 396.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-12-07 11:49:39,702 WARN L192 SmtUtils]: Spent 615.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 27 [2019-12-07 11:49:40,325 WARN L192 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-12-07 11:49:40,542 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-12-07 11:49:40,751 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-12-07 11:49:41,025 WARN L192 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-12-07 11:49:41,419 WARN L192 SmtUtils]: Spent 393.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 43 [2019-12-07 11:49:41,997 WARN L192 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 34 [2019-12-07 11:49:42,210 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-12-07 11:49:42,234 INFO L246 CegarLoopResult]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L69(line 69) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L249 CegarLoopResult]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L80(line 80) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-12-07 11:49:42,235 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-12-07 11:49:42,236 INFO L246 CegarLoopResult]: For program point L81(line 81) no Hoare annotation was computed. [2019-12-07 11:49:42,236 INFO L246 CegarLoopResult]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-12-07 11:49:42,236 INFO L242 CegarLoopResult]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-12-07 11:49:42,236 INFO L246 CegarLoopResult]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-12-07 11:49:42,236 INFO L246 CegarLoopResult]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-12-07 11:49:42,236 INFO L242 CegarLoopResult]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse1) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-12-07 11:49:42,236 INFO L246 CegarLoopResult]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-12-07 11:49:42,236 INFO L242 CegarLoopResult]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse1 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse2) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)) (and .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (not .cse1) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-12-07 11:49:42,236 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-12-07 11:49:42,236 INFO L242 CegarLoopResult]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and .cse0 .cse1 .cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse3 (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (not .cse3) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2019-12-07 11:49:42,236 INFO L242 CegarLoopResult]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-12-07 11:49:42,236 INFO L242 CegarLoopResult]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short11| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-12-07 11:49:42,236 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-12-07 11:49:42,237 INFO L242 CegarLoopResult]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short15|)) (.cse2 (not |ULTIMATE.start_main_#t~short11|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse2 (not .cse0)))) [2019-12-07 11:49:42,237 INFO L242 CegarLoopResult]: At program point L57-3(line 57) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short15|) (not |ULTIMATE.start_main_#t~short11|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short14|) [2019-12-07 11:49:42,237 INFO L242 CegarLoopResult]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse1 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse3 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 .cse3 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse1 .cse1))) (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse2 .cse3 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)))) [2019-12-07 11:49:42,237 INFO L242 CegarLoopResult]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and .cse0 |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) |ULTIMATE.start_main_#t~short19| (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)))) [2019-12-07 11:49:42,237 INFO L242 CegarLoopResult]: At program point L57-6(line 57) the Hoare annotation is: (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))))) [2019-12-07 11:49:42,237 INFO L242 CegarLoopResult]: At program point L57-7(line 57) the Hoare annotation is: (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-12-07 11:49:42,237 INFO L246 CegarLoopResult]: For program point L74(line 74) no Hoare annotation was computed. [2019-12-07 11:49:42,237 INFO L246 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2019-12-07 11:49:42,237 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-12-07 11:49:42,237 INFO L246 CegarLoopResult]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-12-07 11:49:42,237 INFO L242 CegarLoopResult]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and .cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmin_float_#res|) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse2) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-12-07 11:49:42,237 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-12-07 11:49:42,238 INFO L246 CegarLoopResult]: For program point L75(line 75) no Hoare annotation was computed. [2019-12-07 11:49:42,238 INFO L246 CegarLoopResult]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-12-07 11:49:42,238 INFO L246 CegarLoopResult]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-12-07 11:49:42,238 INFO L246 CegarLoopResult]: For program point L68(line 68) no Hoare annotation was computed. [2019-12-07 11:49:42,238 INFO L246 CegarLoopResult]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-12-07 11:49:42,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 11:49:42 BoogieIcfgContainer [2019-12-07 11:49:42,262 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 11:49:42,262 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 11:49:42,262 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 11:49:42,262 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 11:49:42,263 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 11:49:15" (3/4) ... [2019-12-07 11:49:42,266 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-12-07 11:49:42,279 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2019-12-07 11:49:42,279 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-12-07 11:49:42,279 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-12-07 11:49:42,299 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-12-07 11:49:42,299 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-12-07 11:49:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) [2019-12-07 11:49:42,300 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-12-07 11:49:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-12-07 11:49:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-12-07 11:49:42,300 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-12-07 11:49:42,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-12-07 11:49:42,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) [2019-12-07 11:49:42,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) [2019-12-07 11:49:42,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) [2019-12-07 11:49:42,301 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-12-07 11:49:42,302 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-12-07 11:49:42,328 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8e961cd3-2ad4-4533-9427-5878ba7b0144/bin/uautomizer/witness.graphml [2019-12-07 11:49:42,328 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 11:49:42,329 INFO L168 Benchmark]: Toolchain (without parser) took 27336.24 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 312.0 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -97.4 MB). Peak memory consumption was 214.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:42,329 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 11:49:42,329 INFO L168 Benchmark]: CACSL2BoogieTranslator took 165.11 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:42,330 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:42,330 INFO L168 Benchmark]: Boogie Preprocessor took 24.88 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-12-07 11:49:42,330 INFO L168 Benchmark]: RCFGBuilder took 287.31 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:42,330 INFO L168 Benchmark]: TraceAbstraction took 26729.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 424.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:42,330 INFO L168 Benchmark]: Witness Printer took 65.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-12-07 11:49:42,332 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 165.11 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.18 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 122.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -168.8 MB). Peak memory consumption was 10.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.88 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 287.31 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: 24.5 MB). Peak memory consumption was 24.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26729.73 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 189.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 424.7 MB. Max. memory is 11.5 GB. * Witness Printer took 65.96 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 81]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y))) || ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((y == y && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(y, y)) && y == \result) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) || ((((((((y == y && y == x) && aux-isnan_float(x) && !isnan_float(y)-aux) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(\result, y)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && 1bv32 == \result) && 0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((((y == y && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])))) || (((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: (((((((y == y && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && ~fp.eq~FLOAT(x, x)) && !(0bv32 == \result)) && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 59]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) || ((((1bv32 == \result && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !~fp.eq~FLOAT(y, y)) && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: (((((y == y && 1bv32 == \result) && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && x == x) || ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 22.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.9s, HoareTripleCheckerStatistics: 1147 SDtfs, 2748 SDslu, 4436 SDs, 0 SdLazy, 1911 SolverSat, 267 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 9.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1042 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 262 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 917 ImplicationChecksByTransitivity, 6.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, 19 MinimizatonAttempts, 575 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 605 HoareAnnotationTreeSize, 14 FomulaSimplifications, 572514 FormulaSimplificationTreeSizeReduction, 0.4s HoareSimplificationTime, 14 FomulaSimplificationsInter, 62940 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93581 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1413 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...