./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 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/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_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/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.24-678e011 [2019-11-20 10:15:13,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:15:13,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:15:13,477 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:15:13,477 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:15:13,478 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:15:13,479 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:15:13,481 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:15:13,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:15:13,484 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:15:13,485 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:15:13,486 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:15:13,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:15:13,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:15:13,488 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:15:13,489 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:15:13,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:15:13,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:15:13,492 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:15:13,494 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:15:13,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:15:13,503 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:15:13,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:15:13,504 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:15:13,507 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:15:13,507 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:15:13,508 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:15:13,508 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:15:13,509 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:15:13,510 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:15:13,510 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:15:13,510 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:15:13,511 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:15:13,512 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:15:13,513 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:15:13,513 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:15:13,514 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:15:13,514 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:15:13,514 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:15:13,518 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:15:13,520 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:15:13,521 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 10:15:13,544 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:15:13,544 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:15:13,545 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:15:13,545 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:15:13,545 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:15:13,546 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:15:13,546 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:15:13,546 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 10:15:13,546 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:15:13,546 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:15:13,547 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:15:13,547 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:15:13,548 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:15:13,548 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:15:13,548 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:15:13,549 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:15:13,549 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:15:13,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:15:13,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:15:13,549 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:15:13,549 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:15:13,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:15:13,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:15:13,550 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:15:13,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:15:13,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 10:15:13,551 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 10:15:13,551 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:15:13,551 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_7b346e57-e5e0-4474-9110-07f113b089c6/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-11-20 10:15:13,729 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:15:13,744 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:15:13,746 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:15:13,748 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:15:13,748 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:15:13,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-20 10:15:13,811 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/8c39e4293/5544301c36434544b9679b059a4e7666/FLAG863ed8820 [2019-11-20 10:15:14,219 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:15:14,221 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-20 10:15:14,227 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/8c39e4293/5544301c36434544b9679b059a4e7666/FLAG863ed8820 [2019-11-20 10:15:14,631 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/8c39e4293/5544301c36434544b9679b059a4e7666 [2019-11-20 10:15:14,633 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:15:14,634 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:15:14,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:15:14,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:15:14,642 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:15:14,643 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:15:14" (1/1) ... [2019-11-20 10:15:14,646 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be73bae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:14, skipping insertion in model container [2019-11-20 10:15:14,646 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:15:14" (1/1) ... [2019-11-20 10:15:14,654 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:15:14,679 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:15:14,968 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:15:14,971 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:15:14,997 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:15:15,018 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:15:15,019 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15 WrapperNode [2019-11-20 10:15:15,019 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:15:15,020 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:15:15,020 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:15:15,020 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:15:15,028 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,038 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:15:15,065 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:15:15,065 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:15:15,065 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:15:15,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,078 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,078 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,086 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,099 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... [2019-11-20 10:15:15,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:15:15,112 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:15:15,113 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:15:15,113 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:15:15,114 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:15:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:15:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 10:15:15,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:15:15,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:15:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 10:15:15,178 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:15:15,575 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:15:15,576 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-20 10:15:15,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:15 BoogieIcfgContainer [2019-11-20 10:15:15,577 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:15:15,580 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:15:15,580 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:15:15,583 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:15:15,583 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:15:14" (1/3) ... [2019-11-20 10:15:15,584 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e82fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:15:15, skipping insertion in model container [2019-11-20 10:15:15,584 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:15" (2/3) ... [2019-11-20 10:15:15,585 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e82fa2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:15:15, skipping insertion in model container [2019-11-20 10:15:15,585 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:15" (3/3) ... [2019-11-20 10:15:15,587 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-20 10:15:15,596 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:15:15,604 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-20 10:15:15,612 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-20 10:15:15,632 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:15:15,632 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:15:15,633 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:15:15,633 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:15:15,633 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:15:15,633 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:15:15,633 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:15:15,634 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:15:15,645 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-20 10:15:15,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 10:15:15,650 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:15,651 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:15,651 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:15,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:15,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-20 10:15:15,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:15,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842215768] [2019-11-20 10:15:15,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:15,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:15,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:15,801 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [842215768] [2019-11-20 10:15:15,801 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:15,802 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:15,802 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308204413] [2019-11-20 10:15:15,806 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:15,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:15,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:15,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:15,821 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-11-20 10:15:15,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:15,892 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-11-20 10:15:15,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:15:15,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-11-20 10:15:15,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:15,908 INFO L225 Difference]: With dead ends: 90 [2019-11-20 10:15:15,908 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 10:15:15,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:15:15,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 10:15:15,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-20 10:15:15,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 10:15:15,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-20 10:15:15,961 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-11-20 10:15:15,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:15,962 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-20 10:15:15,963 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:15,963 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-20 10:15:15,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 10:15:15,965 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:15,965 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:15,966 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:15,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:15,966 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-20 10:15:15,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:15,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920191552] [2019-11-20 10:15:15,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:16,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:16,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-11-20 10:15:16,051 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920191552] [2019-11-20 10:15:16,051 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:16,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 10:15:16,052 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9371896] [2019-11-20 10:15:16,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:16,053 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:16,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:16,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:16,054 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-11-20 10:15:16,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:16,107 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-11-20 10:15:16,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:16,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 10:15:16,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:16,109 INFO L225 Difference]: With dead ends: 77 [2019-11-20 10:15:16,109 INFO L226 Difference]: Without dead ends: 64 [2019-11-20 10:15:16,110 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:15:16,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-11-20 10:15:16,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-11-20 10:15:16,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 10:15:16,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-20 10:15:16,118 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-20 10:15:16,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:16,118 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-20 10:15:16,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:16,119 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-20 10:15:16,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 10:15:16,120 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:16,120 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:16,120 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:16,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:16,121 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-20 10:15:16,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:16,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842226603] [2019-11-20 10:15:16,122 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:16,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:16,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842226603] [2019-11-20 10:15:16,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:16,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 10:15:16,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886828004] [2019-11-20 10:15:16,188 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:15:16,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 10:15:16,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:15:16,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:15:16,189 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-11-20 10:15:16,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:16,219 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-11-20 10:15:16,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:15:16,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-20 10:15:16,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:16,221 INFO L225 Difference]: With dead ends: 50 [2019-11-20 10:15:16,221 INFO L226 Difference]: Without dead ends: 48 [2019-11-20 10:15:16,222 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:15:16,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-11-20 10:15:16,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-11-20 10:15:16,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-20 10:15:16,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-11-20 10:15:16,233 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-11-20 10:15:16,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:16,240 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-11-20 10:15:16,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:15:16,241 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-11-20 10:15:16,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 10:15:16,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:16,242 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:16,242 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:16,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:16,243 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-20 10:15:16,243 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 10:15:16,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66518132] [2019-11-20 10:15:16,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 10:15:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:15:16,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 10:15:16,380 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 10:15:16,380 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 10:15:16,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:15:16 BoogieIcfgContainer [2019-11-20 10:15:16,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:15:16,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:15:16,410 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:15:16,410 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:15:16,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:15" (3/4) ... [2019-11-20 10:15:16,413 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 10:15:16,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:15:16,415 INFO L168 Benchmark]: Toolchain (without parser) took 1780.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -109.7 MB). Peak memory consumption was 43.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:16,416 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:15:16,416 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:16,417 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:16,417 INFO L168 Benchmark]: Boogie Preprocessor took 46.98 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:15:16,418 INFO L168 Benchmark]: RCFGBuilder took 466.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:16,419 INFO L168 Benchmark]: TraceAbstraction took 829.87 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:16,419 INFO L168 Benchmark]: Witness Printer took 3.71 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:15:16,423 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 384.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -197.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.98 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 466.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 829.87 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: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.71 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. * 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.7s, 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.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 10:15:18,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 10:15:18,148 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 10:15:18,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 10:15:18,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 10:15:18,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 10:15:18,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 10:15:18,163 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 10:15:18,165 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 10:15:18,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 10:15:18,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 10:15:18,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 10:15:18,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 10:15:18,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 10:15:18,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 10:15:18,172 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 10:15:18,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 10:15:18,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 10:15:18,175 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 10:15:18,178 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 10:15:18,180 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 10:15:18,181 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 10:15:18,182 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 10:15:18,183 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 10:15:18,185 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 10:15:18,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 10:15:18,186 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 10:15:18,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 10:15:18,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 10:15:18,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 10:15:18,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 10:15:18,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 10:15:18,190 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 10:15:18,191 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 10:15:18,192 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 10:15:18,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 10:15:18,193 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 10:15:18,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 10:15:18,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 10:15:18,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 10:15:18,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 10:15:18,196 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 10:15:18,212 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 10:15:18,212 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 10:15:18,213 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 10:15:18,213 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 10:15:18,214 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 10:15:18,214 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 10:15:18,214 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 10:15:18,214 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 10:15:18,215 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 10:15:18,215 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 10:15:18,215 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 10:15:18,215 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 10:15:18,216 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 10:15:18,216 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 10:15:18,216 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 10:15:18,216 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 10:15:18,217 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 10:15:18,217 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 10:15:18,217 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 10:15:18,217 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 10:15:18,218 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 10:15:18,218 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 10:15:18,218 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:15:18,218 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 10:15:18,219 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 10:15:18,219 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 10:15:18,219 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 10:15:18,219 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 10:15:18,220 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 10:15:18,220 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 10:15:18,220 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_7b346e57-e5e0-4474-9110-07f113b089c6/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-11-20 10:15:18,518 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 10:15:18,529 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 10:15:18,532 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 10:15:18,533 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 10:15:18,534 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 10:15:18,534 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-20 10:15:18,582 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/beacfa5be/30a80380aff74782b1237e986d4f4874/FLAG08804fc0b [2019-11-20 10:15:18,963 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 10:15:18,964 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-11-20 10:15:18,969 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/beacfa5be/30a80380aff74782b1237e986d4f4874/FLAG08804fc0b [2019-11-20 10:15:18,980 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/data/beacfa5be/30a80380aff74782b1237e986d4f4874 [2019-11-20 10:15:18,983 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 10:15:18,984 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 10:15:18,985 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 10:15:18,985 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 10:15:18,988 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 10:15:18,989 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:15:18" (1/1) ... [2019-11-20 10:15:18,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d4c7b7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:18, skipping insertion in model container [2019-11-20 10:15:18,992 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:15:18" (1/1) ... [2019-11-20 10:15:18,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 10:15:19,015 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 10:15:19,157 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:15:19,162 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 10:15:19,202 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 10:15:19,223 INFO L192 MainTranslator]: Completed translation [2019-11-20 10:15:19,224 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19 WrapperNode [2019-11-20 10:15:19,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 10:15:19,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 10:15:19,225 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 10:15:19,225 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 10:15:19,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,356 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 10:15:19,356 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 10:15:19,356 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 10:15:19,357 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 10:15:19,365 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,366 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,385 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,394 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,411 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,416 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... [2019-11-20 10:15:19,420 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 10:15:19,420 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 10:15:19,420 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 10:15:19,421 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 10:15:19,421 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 10:15:19,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 10:15:19,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 10:15:19,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 10:15:19,503 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 10:15:19,503 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-11-20 10:15:19,503 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 10:15:20,043 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 10:15:20,043 INFO L285 CfgBuilder]: Removed 30 assume(true) statements. [2019-11-20 10:15:20,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:20 BoogieIcfgContainer [2019-11-20 10:15:20,044 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 10:15:20,045 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 10:15:20,045 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 10:15:20,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 10:15:20,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:15:18" (1/3) ... [2019-11-20 10:15:20,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4303efa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:15:20, skipping insertion in model container [2019-11-20 10:15:20,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:15:19" (2/3) ... [2019-11-20 10:15:20,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4303efa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:15:20, skipping insertion in model container [2019-11-20 10:15:20,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:20" (3/3) ... [2019-11-20 10:15:20,051 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-11-20 10:15:20,059 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 10:15:20,065 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-20 10:15:20,073 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-20 10:15:20,092 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 10:15:20,092 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 10:15:20,093 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 10:15:20,093 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 10:15:20,093 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 10:15:20,093 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 10:15:20,093 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 10:15:20,093 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 10:15:20,105 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-11-20 10:15:20,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 10:15:20,112 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:20,113 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:20,113 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:20,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:20,118 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-11-20 10:15:20,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:20,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1990575532] [2019-11-20 10:15:20,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:20,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:20,213 INFO L255 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 10:15:20,218 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:20,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:20,233 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:20,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1990575532] [2019-11-20 10:15:20,239 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:20,239 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 10:15:20,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871915485] [2019-11-20 10:15:20,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 10:15:20,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 10:15:20,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 10:15:20,259 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-11-20 10:15:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:20,279 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-11-20 10:15:20,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 10:15:20,281 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-11-20 10:15:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:20,289 INFO L225 Difference]: With dead ends: 82 [2019-11-20 10:15:20,289 INFO L226 Difference]: Without dead ends: 43 [2019-11-20 10:15:20,292 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 10:15:20,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-11-20 10:15:20,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-11-20 10:15:20,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 10:15:20,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-11-20 10:15:20,327 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-11-20 10:15:20,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:20,327 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-11-20 10:15:20,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 10:15:20,328 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-11-20 10:15:20,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-20 10:15:20,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:20,329 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:20,535 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 10:15:20,535 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:20,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:20,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-11-20 10:15:20,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:20,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [693794082] [2019-11-20 10:15:20,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:20,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:20,619 INFO L255 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:15:20,620 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:20,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:20,654 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:20,658 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:20,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:20,666 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [693794082] [2019-11-20 10:15:20,666 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:20,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 10:15:20,667 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476529543] [2019-11-20 10:15:20,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:20,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:20,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:20,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:20,671 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-11-20 10:15:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:20,744 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-11-20 10:15:20,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 10:15:20,745 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-11-20 10:15:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:20,747 INFO L225 Difference]: With dead ends: 82 [2019-11-20 10:15:20,748 INFO L226 Difference]: Without dead ends: 50 [2019-11-20 10:15:20,749 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:15:20,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-20 10:15:20,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-11-20 10:15:20,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-20 10:15:20,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-11-20 10:15:20,763 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-11-20 10:15:20,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:20,764 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-11-20 10:15:20,764 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-11-20 10:15:20,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 10:15:20,766 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:20,767 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:20,970 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 10:15:20,970 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:20,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:20,971 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-11-20 10:15:20,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:20,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445542127] [2019-11-20 10:15:20,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:21,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:21,057 INFO L255 TraceCheckSpWp]: Trace formula consists of 54 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:15:21,059 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:21,101 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:21,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:21,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445542127] [2019-11-20 10:15:21,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:21,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:15:21,124 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485219325] [2019-11-20 10:15:21,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:15:21,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:21,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:15:21,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:15:21,126 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-11-20 10:15:21,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:21,221 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-11-20 10:15:21,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:15:21,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-11-20 10:15:21,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:21,224 INFO L225 Difference]: With dead ends: 96 [2019-11-20 10:15:21,224 INFO L226 Difference]: Without dead ends: 83 [2019-11-20 10:15:21,225 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:15:21,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-11-20 10:15:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-11-20 10:15:21,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-20 10:15:21,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-11-20 10:15:21,232 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-11-20 10:15:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:21,233 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-11-20 10:15:21,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:15:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-11-20 10:15:21,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-20 10:15:21,234 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:21,234 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:21,435 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 10:15:21,435 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:21,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:21,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-11-20 10:15:21,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:21,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1396882960] [2019-11-20 10:15:21,436 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:21,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:15:21,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:21,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:21,540 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:21,571 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:21,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-11-20 10:15:21,594 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:21,596 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:21,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:21,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-11-20 10:15:21,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1396882960] [2019-11-20 10:15:21,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:21,669 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-20 10:15:21,669 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148841947] [2019-11-20 10:15:21,670 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:15:21,670 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:21,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:15:21,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:15:21,670 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-11-20 10:15:22,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:22,297 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-11-20 10:15:22,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:15:22,297 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-11-20 10:15:22,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:22,299 INFO L225 Difference]: With dead ends: 149 [2019-11-20 10:15:22,299 INFO L226 Difference]: Without dead ends: 140 [2019-11-20 10:15:22,300 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:15:22,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-11-20 10:15:22,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-11-20 10:15:22,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-11-20 10:15:22,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-11-20 10:15:22,328 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-11-20 10:15:22,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:22,329 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-11-20 10:15:22,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:15:22,330 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-11-20 10:15:22,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 10:15:22,331 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:22,332 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:22,545 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 10:15:22,545 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:22,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:22,546 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-11-20 10:15:22,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:22,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [264899081] [2019-11-20 10:15:22,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:22,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:22,623 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:15:22,625 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:22,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:22,646 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:22,673 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:22,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:22,805 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:22,908 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:22,936 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:22,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:22,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [264899081] [2019-11-20 10:15:22,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:22,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-11-20 10:15:22,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957057252] [2019-11-20 10:15:22,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 10:15:22,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:22,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 10:15:22,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:15:22,964 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-11-20 10:15:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:23,906 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-11-20 10:15:23,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-20 10:15:23,910 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-11-20 10:15:23,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:23,912 INFO L225 Difference]: With dead ends: 180 [2019-11-20 10:15:23,912 INFO L226 Difference]: Without dead ends: 178 [2019-11-20 10:15:23,913 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=185, Invalid=465, Unknown=0, NotChecked=0, Total=650 [2019-11-20 10:15:23,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-11-20 10:15:23,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-11-20 10:15:23,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 10:15:23,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-11-20 10:15:23,928 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-11-20 10:15:23,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:23,928 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-11-20 10:15:23,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 10:15:23,928 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-11-20 10:15:23,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-20 10:15:23,930 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:23,930 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:24,142 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 10:15:24,142 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:24,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:24,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-11-20 10:15:24,143 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:24,143 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [309074177] [2019-11-20 10:15:24,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:24,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:24,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:15:24,196 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:24,216 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:24,237 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:24,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:24,256 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:24,257 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:24,259 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:24,272 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:24,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [309074177] [2019-11-20 10:15:24,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:24,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-20 10:15:24,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651143913] [2019-11-20 10:15:24,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:15:24,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:24,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:15:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:15:24,305 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-11-20 10:15:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:24,676 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-11-20 10:15:24,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:15:24,677 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-11-20 10:15:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:24,678 INFO L225 Difference]: With dead ends: 166 [2019-11-20 10:15:24,678 INFO L226 Difference]: Without dead ends: 131 [2019-11-20 10:15:24,678 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:15:24,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-11-20 10:15:24,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-11-20 10:15:24,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 10:15:24,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-11-20 10:15:24,690 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-11-20 10:15:24,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:24,690 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-11-20 10:15:24,691 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:15:24,691 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-11-20 10:15:24,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 10:15:24,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:24,692 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:24,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 10:15:24,907 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:24,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:24,907 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-11-20 10:15:24,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:24,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031570523] [2019-11-20 10:15:24,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:24,987 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:15:24,988 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:25,009 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:25,009 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:25,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:25,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031570523] [2019-11-20 10:15:25,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:25,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 10:15:25,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718126736] [2019-11-20 10:15:25,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 10:15:25,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:25,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 10:15:25,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 10:15:25,025 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-11-20 10:15:25,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:25,121 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-11-20 10:15:25,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 10:15:25,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-11-20 10:15:25,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:25,125 INFO L225 Difference]: With dead ends: 157 [2019-11-20 10:15:25,125 INFO L226 Difference]: Without dead ends: 141 [2019-11-20 10:15:25,126 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 10:15:25,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-11-20 10:15:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-11-20 10:15:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 10:15:25,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-20 10:15:25,149 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-20 10:15:25,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:25,149 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-20 10:15:25,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 10:15:25,150 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-20 10:15:25,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-20 10:15:25,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:25,151 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:25,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 10:15:25,365 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:25,365 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-11-20 10:15:25,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:25,366 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [836144844] [2019-11-20 10:15:25,366 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:25,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:25,425 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-20 10:15:25,427 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:25,431 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:25,432 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:25,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:25,433 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [836144844] [2019-11-20 10:15:25,433 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:25,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-20 10:15:25,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978712599] [2019-11-20 10:15:25,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 10:15:25,434 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:25,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 10:15:25,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:15:25,434 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-11-20 10:15:25,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:25,465 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-11-20 10:15:25,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 10:15:25,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-20 10:15:25,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:25,466 INFO L225 Difference]: With dead ends: 96 [2019-11-20 10:15:25,466 INFO L226 Difference]: Without dead ends: 94 [2019-11-20 10:15:25,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 10:15:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-20 10:15:25,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-11-20 10:15:25,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-20 10:15:25,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-11-20 10:15:25,476 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-11-20 10:15:25,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:25,477 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-11-20 10:15:25,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 10:15:25,477 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-11-20 10:15:25,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:15:25,478 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:25,478 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:25,691 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 10:15:25,691 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:25,691 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:25,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-11-20 10:15:25,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:25,692 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1231753140] [2019-11-20 10:15:25,692 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:25,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:25,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:15:25,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:25,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:25,790 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:25,827 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:25,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:25,850 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:25,851 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:25,891 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:25,923 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1231753140] [2019-11-20 10:15:25,923 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:25,923 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-11-20 10:15:25,923 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548854499] [2019-11-20 10:15:25,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:15:25,924 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:25,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:15:25,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:15:25,925 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-11-20 10:15:26,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:26,337 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-11-20 10:15:26,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-20 10:15:26,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-11-20 10:15:26,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:26,338 INFO L225 Difference]: With dead ends: 131 [2019-11-20 10:15:26,339 INFO L226 Difference]: Without dead ends: 118 [2019-11-20 10:15:26,339 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:15:26,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-11-20 10:15:26,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-11-20 10:15:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-11-20 10:15:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-11-20 10:15:26,347 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-11-20 10:15:26,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:26,347 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-11-20 10:15:26,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:15:26,347 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-11-20 10:15:26,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:15:26,348 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:26,349 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:26,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-11-20 10:15:26,563 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:26,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:26,563 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-11-20 10:15:26,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:26,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189428159] [2019-11-20 10:15:26,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:26,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:26,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-20 10:15:26,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:26,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:26,683 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:26,710 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:26,751 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:26,752 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:26,753 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:26,764 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:26,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:26,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:26,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189428159] [2019-11-20 10:15:26,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:26,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-11-20 10:15:26,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277634898] [2019-11-20 10:15:26,845 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-20 10:15:26,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:26,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-20 10:15:26,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-11-20 10:15:26,845 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-11-20 10:15:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:27,262 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-11-20 10:15:27,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:15:27,263 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-11-20 10:15:27,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:27,263 INFO L225 Difference]: With dead ends: 114 [2019-11-20 10:15:27,263 INFO L226 Difference]: Without dead ends: 78 [2019-11-20 10:15:27,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-11-20 10:15:27,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-11-20 10:15:27,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-11-20 10:15:27,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-11-20 10:15:27,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-11-20 10:15:27,269 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-11-20 10:15:27,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:27,270 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-11-20 10:15:27,270 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-20 10:15:27,270 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-11-20 10:15:27,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-20 10:15:27,271 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:27,271 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:27,475 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-11-20 10:15:27,476 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:27,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:27,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-11-20 10:15:27,477 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:27,477 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807770571] [2019-11-20 10:15:27,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:27,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:27,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:15:27,532 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:27,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:27,557 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:27,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:27,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:27,606 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:27,607 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:27,612 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:27,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:27,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-11-20 10:15:27,659 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807770571] [2019-11-20 10:15:27,659 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:27,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-11-20 10:15:27,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25382352] [2019-11-20 10:15:27,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 10:15:27,660 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:27,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 10:15:27,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-20 10:15:27,661 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-11-20 10:15:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:27,939 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-11-20 10:15:27,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:15:27,940 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-11-20 10:15:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:27,940 INFO L225 Difference]: With dead ends: 84 [2019-11-20 10:15:27,940 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 10:15:27,941 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-20 10:15:27,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 10:15:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-20 10:15:27,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 10:15:27,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-11-20 10:15:27,946 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-11-20 10:15:27,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:27,946 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-11-20 10:15:27,946 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 10:15:27,946 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-11-20 10:15:27,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 10:15:27,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:27,951 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:28,162 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-11-20 10:15:28,162 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:28,163 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-11-20 10:15:28,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:28,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [676563033] [2019-11-20 10:15:28,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:28,236 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 10:15:28,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:28,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:28,258 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:28,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:28,291 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:28,484 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:28,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:28,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [676563033] [2019-11-20 10:15:28,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:28,543 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 10:15:28,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050991146] [2019-11-20 10:15:28,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:15:28,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:28,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:15:28,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:15:28,544 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-11-20 10:15:28,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:28,960 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-11-20 10:15:28,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 10:15:28,961 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-11-20 10:15:28,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:28,961 INFO L225 Difference]: With dead ends: 82 [2019-11-20 10:15:28,961 INFO L226 Difference]: Without dead ends: 74 [2019-11-20 10:15:28,962 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-11-20 10:15:28,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-20 10:15:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-11-20 10:15:28,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-11-20 10:15:28,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-11-20 10:15:28,968 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-11-20 10:15:28,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:28,968 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-11-20 10:15:28,968 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:15:28,969 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-11-20 10:15:28,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-20 10:15:28,969 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:28,969 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:29,170 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-11-20 10:15:29,170 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:29,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:29,170 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-11-20 10:15:29,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:29,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2104557297] [2019-11-20 10:15:29,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:29,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:29,231 INFO L255 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-20 10:15:29,233 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:29,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:29,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:29,367 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:29,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:29,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:29,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2104557297] [2019-11-20 10:15:29,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:29,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-11-20 10:15:29,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076283828] [2019-11-20 10:15:29,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 10:15:29,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:29,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 10:15:29,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-11-20 10:15:29,573 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-11-20 10:15:30,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:30,585 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-11-20 10:15:30,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-20 10:15:30,586 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-11-20 10:15:30,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:30,587 INFO L225 Difference]: With dead ends: 154 [2019-11-20 10:15:30,587 INFO L226 Difference]: Without dead ends: 134 [2019-11-20 10:15:30,588 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-11-20 10:15:30,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-11-20 10:15:30,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-11-20 10:15:30,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-11-20 10:15:30,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-11-20 10:15:30,596 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-11-20 10:15:30,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:30,596 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-11-20 10:15:30,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 10:15:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-11-20 10:15:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-20 10:15:30,597 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:30,597 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:30,810 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-11-20 10:15:30,810 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:30,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:30,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-11-20 10:15:30,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:30,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1394689677] [2019-11-20 10:15:30,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:30,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:30,876 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 22 conjunts are in the unsatisfiable core [2019-11-20 10:15:30,878 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:30,893 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:30,894 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:30,909 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:31,192 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 29 [2019-11-20 10:15:31,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:31,199 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:31,329 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:31,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:31,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1394689677] [2019-11-20 10:15:31,371 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:31,371 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-11-20 10:15:31,371 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069016824] [2019-11-20 10:15:31,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-11-20 10:15:31,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-20 10:15:31,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:15:31,372 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-11-20 10:15:33,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:33,409 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-11-20 10:15:33,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-20 10:15:33,410 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-11-20 10:15:33,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:33,411 INFO L225 Difference]: With dead ends: 195 [2019-11-20 10:15:33,411 INFO L226 Difference]: Without dead ends: 158 [2019-11-20 10:15:33,412 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-11-20 10:15:33,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-11-20 10:15:33,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-11-20 10:15:33,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-11-20 10:15:33,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-11-20 10:15:33,415 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-11-20 10:15:33,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:33,415 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-11-20 10:15:33,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-11-20 10:15:33,415 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-11-20 10:15:33,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-20 10:15:33,416 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:33,416 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:33,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-11-20 10:15:33,616 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:33,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:33,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-11-20 10:15:33,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:33,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [672163100] [2019-11-20 10:15:33,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:33,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:33,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 21 conjunts are in the unsatisfiable core [2019-11-20 10:15:33,671 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:33,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:33,684 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:33,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:33,863 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:33,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:33,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:33,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [672163100] [2019-11-20 10:15:33,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:33,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-11-20 10:15:33,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213399357] [2019-11-20 10:15:33,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:15:33,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:33,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:15:33,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:15:33,996 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-11-20 10:15:34,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:34,923 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-11-20 10:15:34,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-20 10:15:34,924 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-20 10:15:34,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:34,925 INFO L225 Difference]: With dead ends: 125 [2019-11-20 10:15:34,925 INFO L226 Difference]: Without dead ends: 101 [2019-11-20 10:15:34,926 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-11-20 10:15:34,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-11-20 10:15:34,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-11-20 10:15:34,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-20 10:15:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-20 10:15:34,930 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-11-20 10:15:34,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:34,930 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-20 10:15:34,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:15:34,930 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-11-20 10:15:34,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 10:15:34,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:34,931 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:35,131 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-11-20 10:15:35,132 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:35,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:35,132 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-11-20 10:15:35,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:35,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399420203] [2019-11-20 10:15:35,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:35,202 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-20 10:15:35,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:35,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:35,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:35,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:35,253 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:35,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:35,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:35,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:35,448 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399420203] [2019-11-20 10:15:35,448 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:35,448 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-11-20 10:15:35,448 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536503687] [2019-11-20 10:15:35,449 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-20 10:15:35,449 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:35,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-20 10:15:35,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-11-20 10:15:35,449 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-11-20 10:15:36,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:36,145 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-11-20 10:15:36,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-20 10:15:36,146 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-11-20 10:15:36,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:36,146 INFO L225 Difference]: With dead ends: 52 [2019-11-20 10:15:36,146 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 10:15:36,147 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-11-20 10:15:36,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 10:15:36,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-11-20 10:15:36,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-20 10:15:36,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-11-20 10:15:36,152 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-11-20 10:15:36,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:36,152 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-11-20 10:15:36,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-20 10:15:36,152 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-11-20 10:15:36,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-20 10:15:36,152 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:36,153 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:36,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-11-20 10:15:36,368 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:36,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-11-20 10:15:36,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:36,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [981262572] [2019-11-20 10:15:36,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 18 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:36,457 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 10:15:36,459 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:36,478 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:36,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:36,540 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:36,554 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:36,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:36,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:36,660 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:36,660 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [981262572] [2019-11-20 10:15:36,660 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:36,660 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-11-20 10:15:36,660 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624588835] [2019-11-20 10:15:36,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-20 10:15:36,661 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-20 10:15:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-11-20 10:15:36,661 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-11-20 10:15:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:37,416 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-11-20 10:15:37,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-20 10:15:37,417 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-20 10:15:37,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:37,417 INFO L225 Difference]: With dead ends: 55 [2019-11-20 10:15:37,417 INFO L226 Difference]: Without dead ends: 41 [2019-11-20 10:15:37,418 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-11-20 10:15:37,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-11-20 10:15:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-11-20 10:15:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 10:15:37,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-11-20 10:15:37,421 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-11-20 10:15:37,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:37,422 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-11-20 10:15:37,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-20 10:15:37,422 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-11-20 10:15:37,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-20 10:15:37,422 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:37,422 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:37,622 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-11-20 10:15:37,623 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:37,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:37,623 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-11-20 10:15:37,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:37,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633065573] [2019-11-20 10:15:37,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 19 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:37,687 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-20 10:15:37,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:37,794 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-20 10:15:37,807 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:39,916 WARN L191 SmtUtils]: Spent 2.08 s on a formula simplification that was a NOOP. DAG size: 13 [2019-11-20 10:15:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:39,942 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:40,025 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 10:15:40,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:40,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633065573] [2019-11-20 10:15:40,057 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:40,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-11-20 10:15:40,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874792074] [2019-11-20 10:15:40,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-20 10:15:40,058 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:40,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-20 10:15:40,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-11-20 10:15:40,059 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-11-20 10:15:40,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:40,465 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-11-20 10:15:40,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-20 10:15:40,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-11-20 10:15:40,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:40,467 INFO L225 Difference]: With dead ends: 79 [2019-11-20 10:15:40,467 INFO L226 Difference]: Without dead ends: 61 [2019-11-20 10:15:40,467 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-11-20 10:15:40,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-11-20 10:15:40,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-11-20 10:15:40,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-20 10:15:40,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-11-20 10:15:40,472 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-11-20 10:15:40,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:40,472 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-11-20 10:15:40,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-20 10:15:40,472 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-11-20 10:15:40,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-20 10:15:40,472 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 10:15:40,472 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 10:15:40,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-11-20 10:15:40,673 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 10:15:40,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 10:15:40,673 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-11-20 10:15:40,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 10:15:40,674 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [582264010] [2019-11-20 10:15:40,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/mathsat Starting monitored process 20 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with mathsat -unsat_core_generation=3 [2019-11-20 10:15:40,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 10:15:40,743 INFO L255 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 10:15:40,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 10:15:40,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:40,752 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 10:15:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 10:15:40,754 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [582264010] [2019-11-20 10:15:40,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 10:15:40,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-11-20 10:15:40,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082618362] [2019-11-20 10:15:40,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 10:15:40,754 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 10:15:40,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 10:15:40,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 10:15:40,755 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-11-20 10:15:40,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 10:15:40,771 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-11-20 10:15:40,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 10:15:40,772 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-20 10:15:40,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 10:15:40,772 INFO L225 Difference]: With dead ends: 39 [2019-11-20 10:15:40,772 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 10:15:40,772 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 10:15:40,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 10:15:40,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 10:15:40,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 10:15:40,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 10:15:40,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-11-20 10:15:40,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 10:15:40,773 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 10:15:40,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 10:15:40,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 10:15:40,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 10:15:40,973 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-11-20 10:15:40,977 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 10:15:41,182 WARN L191 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 87 [2019-11-20 10:15:42,213 WARN L191 SmtUtils]: Spent 695.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-11-20 10:15:42,734 WARN L191 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 27 [2019-11-20 10:15:43,200 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 32 [2019-11-20 10:15:43,431 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-11-20 10:15:43,654 WARN L191 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-11-20 10:15:43,999 WARN L191 SmtUtils]: Spent 345.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-11-20 10:15:44,447 WARN L191 SmtUtils]: Spent 447.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2019-11-20 10:15:44,931 WARN L191 SmtUtils]: Spent 483.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 35 [2019-11-20 10:15:45,130 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-11-20 10:15:45,158 INFO L444 ceAbstractionStarter]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-11-20 10:15:45,158 INFO L444 ceAbstractionStarter]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-11-20 10:15:45,158 INFO L444 ceAbstractionStarter]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-11-20 10:15:45,158 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L447 ceAbstractionStarter]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-11-20 10:15:45,159 INFO L444 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L440 ceAbstractionStarter]: At program point L15-2(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (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|)) (and .cse0 (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (not .cse1) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)))) [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L440 ceAbstractionStarter]: At program point L15-6(lines 15 19) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (and .cse0 (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-11-20 10:15:45,160 INFO L444 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-11-20 10:15:45,160 INFO L440 ceAbstractionStarter]: At program point L32(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y))) (or (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|)) (and (= 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))) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmin_float_~x) (and (and (and .cse0 (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (= ULTIMATE.start_fmin_float_~x ULTIMATE.start___fpclassify_float_~x)))) [2019-11-20 10:15:45,161 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 10:15:45,161 INFO L440 ceAbstractionStarter]: At program point L32-1(lines 12 33) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse1 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= ULTIMATE.start_fmin_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (.cse3 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) .cse3) (and .cse0 .cse1 .cse2 (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_main_~y~0) (not .cse3) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))))) [2019-11-20 10:15:45,161 INFO L440 ceAbstractionStarter]: At program point L57(line 57) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-11-20 10:15:45,161 INFO L440 ceAbstractionStarter]: At program point L57-1(line 57) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short11| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-11-20 10:15:45,161 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-11-20 10:15:45,161 INFO L440 ceAbstractionStarter]: At program point L57-2(line 57) the Hoare annotation is: (let ((.cse1 (not |ULTIMATE.start_main_#t~short15|)) (.cse2 (not |ULTIMATE.start_main_#t~short11|)) (.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 .cse1 .cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) .cse2 (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0))))) [2019-11-20 10:15:45,161 INFO L440 ceAbstractionStarter]: At program point L57-3(line 57) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short15|) (not |ULTIMATE.start_main_#t~short11|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short14|) [2019-11-20 10:15:45,161 INFO L440 ceAbstractionStarter]: At program point L57-4(line 57) the Hoare annotation is: (let ((.cse1 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse3 (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))) (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 .cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)) (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 .cse3) (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)) (and (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 .cse3 .cse3)) (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) .cse0 (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))))) [2019-11-20 10:15:45,162 INFO L440 ceAbstractionStarter]: At program point L57-5(line 57) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (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 (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)) (and |ULTIMATE.start_main_#t~short19| .cse1) .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)) (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|) .cse2 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse1))) [2019-11-20 10:15:45,162 INFO L440 ceAbstractionStarter]: At program point L57-6(line 57) the Hoare annotation is: (or (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)))) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) [2019-11-20 10:15:45,162 INFO L440 ceAbstractionStarter]: At program point L57-7(line 57) the Hoare annotation is: (and (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_fmin_float_~y ULTIMATE.start_fmin_float_~y)) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0)))) [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L440 ceAbstractionStarter]: At program point L41-3(lines 35 42) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmin_float_~y)) (.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))) (.cse2 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) (or (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)) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (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 .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 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and .cse0 (= ULTIMATE.start_fmin_float_~y ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmin_float_~y .cse1) (not (fp.eq ULTIMATE.start_fmin_float_~x ULTIMATE.start_fmin_float_~x)) .cse2 (fp.eq |ULTIMATE.start_fmin_float_#res| ULTIMATE.start_main_~y~0)))) [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-20 10:15:45,162 INFO L444 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-11-20 10:15:45,190 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 10:15:45 BoogieIcfgContainer [2019-11-20 10:15:45,190 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 10:15:45,191 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 10:15:45,191 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 10:15:45,191 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 10:15:45,192 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:15:20" (3/4) ... [2019-11-20 10:15:45,194 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 10:15:45,206 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-11-20 10:15:45,207 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-11-20 10:15:45,207 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 10:15:45,232 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-20 10:15:45,233 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) [2019-11-20 10:15:45,233 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) || (((!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) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-20 10:15:45,233 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux [2019-11-20 10:15:45,234 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && x == x) [2019-11-20 10:15:45,234 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == x) && (((y == y && !(0bv32 == \result)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && x == x) [2019-11-20 10:15:45,234 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~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]))) || ((((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)) [2019-11-20 10:15:45,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == y && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) || (((((y == y && y == x) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-11-20 10:15:45,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) || (((((((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(y, y) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) && y == y) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) [2019-11-20 10:15:45,235 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1bv32 == \result && ~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) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) [2019-11-20 10:15:45,236 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)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || ((((((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) [2019-11-20 10:15:45,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~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]))) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-11-20 10:15:45,236 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(\result, x) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(res, x)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) [2019-11-20 10:15:45,265 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7b346e57-e5e0-4474-9110-07f113b089c6/bin/uautomizer/witness.graphml [2019-11-20 10:15:45,265 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 10:15:45,266 INFO L168 Benchmark]: Toolchain (without parser) took 26282.85 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 308.8 MB). Free memory was 957.8 MB in the beginning and 1.1 GB in the end (delta: -97.2 MB). Peak memory consumption was 211.6 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:45,267 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:15:45,267 INFO L168 Benchmark]: CACSL2BoogieTranslator took 239.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 940.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:45,268 INFO L168 Benchmark]: Boogie Procedure Inliner took 131.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:45,268 INFO L168 Benchmark]: Boogie Preprocessor took 63.74 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 10:15:45,268 INFO L168 Benchmark]: RCFGBuilder took 623.89 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:45,269 INFO L168 Benchmark]: TraceAbstraction took 25145.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 406.2 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:45,269 INFO L168 Benchmark]: Witness Printer took 74.59 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 11.5 GB. [2019-11-20 10:15:45,271 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 239.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.8 MB in the beginning and 940.3 MB in the end (delta: 17.4 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 131.55 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -186.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 63.74 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 623.89 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: 27.8 MB). Peak memory consumption was 27.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 25145.55 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 171.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 36.1 MB). Peak memory consumption was 406.2 MB. Max. memory is 11.5 GB. * Witness Printer took 74.59 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 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: (((((((~fp.eq~FLOAT(\result, x) && y == y) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~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]))) || ((((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)) - 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: (((((((~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]))) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && ~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 && y == x) && ~fp.eq~FLOAT(res, y)) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) || ((((((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) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((((1bv32 == \result && ~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) || ((((((y == y && y == x) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((((((y == y && ~fp.eq~FLOAT(y, y)) && y == \result) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res) || (((((((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(y, y) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(\result, x)) && y == y) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 12]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && x == x) && (((y == y && !(0bv32 == \result)) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result) && x == x) - 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) || (((!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) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 15]: Loop Invariant Derived loop invariant: ((((y == y && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(y, y)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == y && x == x) && !~fp.eq~FLOAT(y, y)) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && x == x) - 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: 25.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 9.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.1s, HoareTripleCheckerStatistics: 1149 SDtfs, 2823 SDslu, 4377 SDs, 0 SdLazy, 1918 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 9.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 19 MinimizatonAttempts, 578 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 48 NumberOfFragments, 612 HoareAnnotationTreeSize, 14 FomulaSimplifications, 655011 FormulaSimplificationTreeSizeReduction, 0.5s HoareSimplificationTime, 14 FomulaSimplificationsInter, 9281 FormulaSimplificationTreeSizeReductionInter, 3.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93793 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1394 ConjunctsInSsa, 188 ConjunctsInUnsatCore, 38 InterpolantComputations, 38 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...