./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 cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c -s /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-cad4683 [2019-10-22 08:54:56,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:54:56,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:54:56,698 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:54:56,699 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:54:56,700 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:54:56,700 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:54:56,702 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:54:56,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:54:56,704 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:54:56,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:54:56,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:54:56,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:54:56,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:54:56,710 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:54:56,711 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:54:56,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:54:56,712 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:54:56,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:54:56,727 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:54:56,728 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:54:56,729 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:54:56,730 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:54:56,730 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:54:56,732 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:54:56,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:54:56,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:54:56,733 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:54:56,733 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:54:56,734 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:54:56,734 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:54:56,735 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:54:56,735 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:54:56,736 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:54:56,737 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:54:56,737 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:54:56,738 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:54:56,738 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:54:56,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:54:56,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:54:56,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:54:56,740 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:54:56,749 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:54:56,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:54:56,751 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:54:56,751 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:54:56,751 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:54:56,751 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:54:56,751 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:54:56,751 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:54:56,752 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:54:56,752 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:54:56,752 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:54:56,752 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:54:56,752 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:54:56,752 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:54:56,753 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:54:56,753 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:54:56,753 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:54:56,753 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:54:56,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:54:56,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:54:56,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:54:56,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:54:56,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:54:56,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:54:56,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:54:56,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:54:56,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:54:56,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:54:56,755 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/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:54:56,778 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:54:56,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:54:56,791 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:54:56,792 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:54:56,792 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:54:56,793 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-10-22 08:54:56,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/1f62882fd/82299bc92e7d473a817592a77135b86f/FLAGb86068170 [2019-10-22 08:54:57,245 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:54:57,246 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-10-22 08:54:57,252 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/1f62882fd/82299bc92e7d473a817592a77135b86f/FLAGb86068170 [2019-10-22 08:54:57,262 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/1f62882fd/82299bc92e7d473a817592a77135b86f [2019-10-22 08:54:57,264 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:54:57,265 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:54:57,267 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:57,267 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:54:57,271 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:54:57,271 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,274 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a0c5f71 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57, skipping insertion in model container [2019-10-22 08:54:57,274 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,280 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:54:57,296 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:54:57,426 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:57,430 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:54:57,520 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:54:57,540 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:54:57,540 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57 WrapperNode [2019-10-22 08:54:57,540 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:54:57,541 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:57,541 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:54:57,541 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:54:57,549 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,592 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:54:57,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:54:57,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:54:57,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:54:57,610 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,625 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,637 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,639 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... [2019-10-22 08:54:57,642 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:54:57,642 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:54:57,642 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:54:57,642 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:54:57,643 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:54:57,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:54:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-10-22 08:54:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:54:57,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:54:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:54:57,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:54:58,070 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:54:58,070 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 08:54:58,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:58 BoogieIcfgContainer [2019-10-22 08:54:58,072 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:54:58,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:54:58,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:54:58,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:54:58,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:54:57" (1/3) ... [2019-10-22 08:54:58,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f9a0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:58, skipping insertion in model container [2019-10-22 08:54:58,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:54:57" (2/3) ... [2019-10-22 08:54:58,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54f9a0f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:54:58, skipping insertion in model container [2019-10-22 08:54:58,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:58" (3/3) ... [2019-10-22 08:54:58,079 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-10-22 08:54:58,087 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:54:58,093 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 08:54:58,100 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 08:54:58,120 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:54:58,120 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:54:58,121 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:54:58,121 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:54:58,121 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:54:58,121 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:54:58,121 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:54:58,121 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:54:58,133 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 08:54:58,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:54:58,139 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:58,140 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:58,142 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:58,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:58,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-10-22 08:54:58,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:58,159 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306197671] [2019-10-22 08:54:58,159 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:58,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:58,289 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306197671] [2019-10-22 08:54:58,290 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:58,290 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:58,291 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072642797] [2019-10-22 08:54:58,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:58,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:58,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:58,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:58,314 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-10-22 08:54:58,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:58,425 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-10-22 08:54:58,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:54:58,430 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-22 08:54:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:58,442 INFO L225 Difference]: With dead ends: 90 [2019-10-22 08:54:58,442 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 08:54:58,446 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:58,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 08:54:58,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 08:54:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:54:58,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-10-22 08:54:58,484 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-10-22 08:54:58,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:58,485 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-10-22 08:54:58,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:58,485 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-10-22 08:54:58,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:54:58,486 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:58,486 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:58,486 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:58,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:58,487 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-10-22 08:54:58,487 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:58,487 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305858354] [2019-10-22 08:54:58,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,487 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,488 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:58,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:58,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:58,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305858354] [2019-10-22 08:54:58,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:58,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:54:58,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493891189] [2019-10-22 08:54:58,551 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:54:58,551 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:58,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:54:58,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:54:58,552 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-10-22 08:54:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:58,597 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-10-22 08:54:58,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:54:58,598 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 08:54:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:58,599 INFO L225 Difference]: With dead ends: 77 [2019-10-22 08:54:58,599 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 08:54:58,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:54:58,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 08:54:58,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-10-22 08:54:58,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 08:54:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 08:54:58,610 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-10-22 08:54:58,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:58,610 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:54:58,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:54:58,610 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-10-22 08:54:58,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:54:58,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:58,612 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:58,612 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:58,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:58,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-10-22 08:54:58,612 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:58,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737904769] [2019-10-22 08:54:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,613 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:58,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:54:58,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:54:58,687 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737904769] [2019-10-22 08:54:58,688 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:54:58,688 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:54:58,688 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307476612] [2019-10-22 08:54:58,688 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:54:58,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:54:58,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:54:58,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:58,689 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-10-22 08:54:58,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:54:58,704 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-10-22 08:54:58,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:54:58,704 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 08:54:58,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:54:58,705 INFO L225 Difference]: With dead ends: 50 [2019-10-22 08:54:58,705 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 08:54:58,706 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:54:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 08:54:58,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-22 08:54:58,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 08:54:58,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-10-22 08:54:58,712 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-10-22 08:54:58,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:54:58,712 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-10-22 08:54:58,712 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:54:58,712 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-10-22 08:54:58,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:54:58,713 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:54:58,713 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:54:58,713 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:54:58,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:54:58,714 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-10-22 08:54:58,714 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:54:58,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662655915] [2019-10-22 08:54:58,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,714 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:54:58,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:54:58,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:54:58,827 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:54:58,829 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:54:58,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:54:58 BoogieIcfgContainer [2019-10-22 08:54:58,863 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:54:58,863 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:54:58,863 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:54:58,864 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:54:58,864 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:54:58" (3/4) ... [2019-10-22 08:54:58,868 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:54:58,868 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:54:58,870 INFO L168 Benchmark]: Toolchain (without parser) took 1604.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.5 MB in the beginning and 1.1 GB in the end (delta: -118.5 MB). Peak memory consumption was 44.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,871 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:58,871 INFO L168 Benchmark]: CACSL2BoogieTranslator took 273.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,872 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:58,872 INFO L168 Benchmark]: Boogie Preprocessor took 41.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:54:58,872 INFO L168 Benchmark]: RCFGBuilder took 429.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,873 INFO L168 Benchmark]: TraceAbstraction took 790.70 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: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:54:58,874 INFO L168 Benchmark]: Witness Printer took 4.99 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-10-22 08:54:58,876 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.20 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 273.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.5 MB). Free memory was 944.5 MB in the beginning and 1.2 GB in the end (delta: -209.3 MB). Peak memory consumption was 23.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.96 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.95 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 429.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 36.0 MB). Peak memory consumption was 36.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 790.70 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: 54.9 MB). Peak memory consumption was 54.9 MB. Max. memory is 11.5 GB. * Witness Printer took 4.99 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.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 08:55:00,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:55:00,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:55:00,863 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:55:00,863 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:55:00,864 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:55:00,865 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:55:00,866 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:55:00,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:55:00,868 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:55:00,869 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:55:00,870 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:55:00,870 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:55:00,871 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:55:00,871 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:55:00,872 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:55:00,873 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:55:00,873 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:55:00,875 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:55:00,876 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:55:00,877 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:55:00,878 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:55:00,879 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:55:00,880 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:55:00,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:55:00,882 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:55:00,882 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:55:00,882 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:55:00,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:55:00,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:55:00,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:55:00,884 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:55:00,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:55:00,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:55:00,886 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:55:00,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:55:00,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:55:00,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:55:00,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:55:00,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:55:00,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:55:00,889 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 08:55:00,900 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:55:00,900 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:55:00,901 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:55:00,901 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:55:00,901 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:55:00,902 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:55:00,902 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:55:00,902 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:55:00,902 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:55:00,902 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:55:00,902 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:55:00,902 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:55:00,903 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 08:55:00,903 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 08:55:00,903 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:55:00,903 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:55:00,903 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:55:00,903 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:55:00,903 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:55:00,904 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:55:00,904 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:55:00,904 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:55:00,904 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:55:00,904 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:55:00,904 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:55:00,905 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:55:00,905 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 08:55:00,905 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 08:55:00,905 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:55:00,905 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 08:55:00,905 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/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:00,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:55:00,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:55:00,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:55:00,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:55:00,944 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:55:00,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/../../sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-10-22 08:55:00,990 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/9dcc92514/3109a93bdf9a4e159847f5dbc605c9a6/FLAG5b7bda407 [2019-10-22 08:55:01,388 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:55:01,390 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/sv-benchmarks/c/float-newlib/float_req_bl_1231.c [2019-10-22 08:55:01,396 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/9dcc92514/3109a93bdf9a4e159847f5dbc605c9a6/FLAG5b7bda407 [2019-10-22 08:55:01,797 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/data/9dcc92514/3109a93bdf9a4e159847f5dbc605c9a6 [2019-10-22 08:55:01,800 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:55:01,801 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:55:01,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:01,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:55:01,805 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:55:01,806 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62f1c206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:01, skipping insertion in model container [2019-10-22 08:55:01,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:55:01" (1/1) ... [2019-10-22 08:55:01,815 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:55:01,830 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:55:01,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:01,998 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:55:02,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:55:02,044 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:55:02,044 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02 WrapperNode [2019-10-22 08:55:02,044 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:55:02,045 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:02,046 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:55:02,046 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:55:02,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:55:02,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:55:02,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:55:02,138 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:55:02,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,150 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,151 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,183 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... [2019-10-22 08:55:02,191 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:55:02,191 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:55:02,192 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:55:02,192 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:55:02,193 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:55:02,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 08:55:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:55:02,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:55:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-10-22 08:55:02,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:55:02,560 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:55:02,561 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 08:55:02,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:02 BoogieIcfgContainer [2019-10-22 08:55:02,562 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:55:02,563 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:55:02,563 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:55:02,566 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:55:02,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:55:01" (1/3) ... [2019-10-22 08:55:02,575 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e176f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:02, skipping insertion in model container [2019-10-22 08:55:02,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:55:02" (2/3) ... [2019-10-22 08:55:02,580 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e176f45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:55:02, skipping insertion in model container [2019-10-22 08:55:02,580 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:02" (3/3) ... [2019-10-22 08:55:02,583 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1231.c [2019-10-22 08:55:02,604 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:55:02,610 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 08:55:02,622 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 08:55:02,643 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:55:02,644 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:55:02,644 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:55:02,644 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:55:02,644 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:55:02,644 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:55:02,644 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:55:02,644 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:55:02,657 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 08:55:02,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:55:02,662 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:02,663 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:02,665 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:02,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:02,670 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-10-22 08:55:02,676 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:02,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51352268] [2019-10-22 08:55:02,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:02,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:02,748 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 08:55:02,752 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:02,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:02,765 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:02,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:02,771 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51352268] [2019-10-22 08:55:02,771 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:02,772 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 08:55:02,772 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259252625] [2019-10-22 08:55:02,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:55:02,776 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:02,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:55:02,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:02,790 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-22 08:55:02,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:02,808 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-10-22 08:55:02,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:55:02,810 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 08:55:02,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:02,819 INFO L225 Difference]: With dead ends: 82 [2019-10-22 08:55:02,819 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 08:55:02,822 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:55:02,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 08:55:02,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 08:55:02,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:55:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-10-22 08:55:02,854 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-10-22 08:55:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:02,855 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-10-22 08:55:02,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:55:02,855 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-10-22 08:55:02,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 08:55:02,855 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:02,856 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:03,056 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-10-22 08:55:03,056 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:03,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:03,057 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-10-22 08:55:03,057 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:03,057 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1014639612] [2019-10-22 08:55:03,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:03,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:03,122 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:03,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:03,143 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:03,148 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:03,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:03,152 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1014639612] [2019-10-22 08:55:03,153 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:03,153 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 08:55:03,153 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779957016] [2019-10-22 08:55:03,154 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:03,155 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:03,155 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-10-22 08:55:03,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:03,227 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-10-22 08:55:03,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:55:03,228 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 08:55:03,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:03,229 INFO L225 Difference]: With dead ends: 82 [2019-10-22 08:55:03,229 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 08:55:03,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:03,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 08:55:03,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 08:55:03,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 08:55:03,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-10-22 08:55:03,241 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-10-22 08:55:03,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:03,242 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-10-22 08:55:03,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:03,242 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-10-22 08:55:03,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:55:03,243 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:03,243 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:03,443 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-10-22 08:55:03,444 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:03,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:03,444 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-10-22 08:55:03,445 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:03,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [612991947] [2019-10-22 08:55:03,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:03,509 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:03,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:03,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:03,529 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:03,546 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [612991947] [2019-10-22 08:55:03,546 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:03,547 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:55:03,547 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097380941] [2019-10-22 08:55:03,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:03,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:03,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:03,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:03,549 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-10-22 08:55:03,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:03,668 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-10-22 08:55:03,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:03,668 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 08:55:03,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:03,669 INFO L225 Difference]: With dead ends: 96 [2019-10-22 08:55:03,669 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 08:55:03,670 INFO L600 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-10-22 08:55:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 08:55:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-10-22 08:55:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 08:55:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 08:55:03,677 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-10-22 08:55:03,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:03,678 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 08:55:03,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:03,678 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-10-22 08:55:03,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 08:55:03,681 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:03,681 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:03,890 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-10-22 08:55:03,891 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:03,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:03,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-10-22 08:55:03,891 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:03,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537981770] [2019-10-22 08:55:03,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:03,956 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:03,958 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:03,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:04,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:04,050 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:04,050 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:04,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:04,093 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:04,122 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537981770] [2019-10-22 08:55:04,131 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:04,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-10-22 08:55:04,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309859436] [2019-10-22 08:55:04,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:55:04,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:04,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:55:04,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:04,133 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-10-22 08:55:04,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:04,627 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-10-22 08:55:04,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:55:04,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-10-22 08:55:04,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:04,631 INFO L225 Difference]: With dead ends: 149 [2019-10-22 08:55:04,631 INFO L226 Difference]: Without dead ends: 140 [2019-10-22 08:55:04,631 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:04,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-22 08:55:04,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-10-22 08:55:04,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 08:55:04,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-10-22 08:55:04,654 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-10-22 08:55:04,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:04,655 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-10-22 08:55:04,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:55:04,655 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-10-22 08:55:04,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:55:04,656 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:04,656 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:04,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-10-22 08:55:04,866 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:04,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:04,866 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-10-22 08:55:04,866 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:04,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123007118] [2019-10-22 08:55:04,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:04,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:04,931 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:04,962 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:04,963 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:04,984 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:05,109 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:05,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:05,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:05,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:05,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123007118] [2019-10-22 08:55:05,246 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:05,246 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-10-22 08:55:05,246 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150801918] [2019-10-22 08:55:05,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 08:55:05,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:05,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:55:05,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:05,248 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-10-22 08:55:05,818 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-10-22 08:55:06,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:06,100 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-10-22 08:55:06,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 08:55:06,101 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-10-22 08:55:06,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:06,102 INFO L225 Difference]: With dead ends: 180 [2019-10-22 08:55:06,102 INFO L226 Difference]: Without dead ends: 178 [2019-10-22 08:55:06,103 INFO L600 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-10-22 08:55:06,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-22 08:55:06,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-10-22 08:55:06,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:55:06,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-10-22 08:55:06,120 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-10-22 08:55:06,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:06,121 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-10-22 08:55:06,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 08:55:06,121 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-10-22 08:55:06,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 08:55:06,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:06,122 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:06,322 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-10-22 08:55:06,323 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:06,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:06,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-10-22 08:55:06,323 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:06,323 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [40337964] [2019-10-22 08:55:06,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:06,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:06,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:06,381 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:06,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:06,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:06,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:06,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:06,461 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:06,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:06,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:06,480 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:06,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [40337964] [2019-10-22 08:55:06,499 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:06,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-10-22 08:55:06,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561435431] [2019-10-22 08:55:06,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:55:06,500 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:06,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:55:06,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:06,500 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-10-22 08:55:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:06,835 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-10-22 08:55:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:55:06,836 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-10-22 08:55:06,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:06,837 INFO L225 Difference]: With dead ends: 166 [2019-10-22 08:55:06,837 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 08:55:06,838 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=139, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 08:55:06,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-10-22 08:55:06,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:55:06,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-10-22 08:55:06,847 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-10-22 08:55:06,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:06,847 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-10-22 08:55:06,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:55:06,848 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-10-22 08:55:06,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:55:06,848 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:06,849 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:07,057 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-10-22 08:55:07,058 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:07,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,058 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-10-22 08:55:07,058 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:07,058 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [555747016] [2019-10-22 08:55:07,058 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,120 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:07,121 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:07,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,130 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:07,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [555747016] [2019-10-22 08:55:07,144 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:07,144 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:55:07,144 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784008849] [2019-10-22 08:55:07,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:55:07,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:07,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:55:07,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:55:07,145 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-10-22 08:55:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:07,222 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-10-22 08:55:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:55:07,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 08:55:07,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:07,230 INFO L225 Difference]: With dead ends: 157 [2019-10-22 08:55:07,230 INFO L226 Difference]: Without dead ends: 141 [2019-10-22 08:55:07,230 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:55:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-22 08:55:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-10-22 08:55:07,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 08:55:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-10-22 08:55:07,247 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-10-22 08:55:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:07,248 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 08:55:07,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:55:07,248 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-10-22 08:55:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 08:55:07,249 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:07,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:07,461 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-10-22 08:55:07,461 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:07,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-10-22 08:55:07,461 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:07,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1412180694] [2019-10-22 08:55:07,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 08:55:07,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,535 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1412180694] [2019-10-22 08:55:07,537 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:07,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 08:55:07,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174383650] [2019-10-22 08:55:07,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:55:07,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:07,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:55:07,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:07,539 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-10-22 08:55:07,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:07,575 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-10-22 08:55:07,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:55:07,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 08:55:07,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:07,576 INFO L225 Difference]: With dead ends: 96 [2019-10-22 08:55:07,576 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 08:55:07,576 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:55:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 08:55:07,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-10-22 08:55:07,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 08:55:07,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-10-22 08:55:07,584 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-10-22 08:55:07,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:07,584 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 08:55:07,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:55:07,584 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-10-22 08:55:07,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:55:07,586 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:07,586 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:07,797 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-10-22 08:55:07,797 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:07,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:07,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-10-22 08:55:07,798 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:07,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [714936878] [2019-10-22 08:55:07,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:07,883 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:07,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:07,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:07,903 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:07,923 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,940 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:07,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:07,968 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:07,982 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:07,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [714936878] [2019-10-22 08:55:07,983 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:07,983 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-10-22 08:55:07,983 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468863643] [2019-10-22 08:55:07,983 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:55:07,983 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:07,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:55:07,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:07,984 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-10-22 08:55:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,299 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-10-22 08:55:08,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:55:08,300 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 08:55:08,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:08,300 INFO L225 Difference]: With dead ends: 131 [2019-10-22 08:55:08,301 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 08:55:08,301 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:08,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 08:55:08,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-10-22 08:55:08,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 08:55:08,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-10-22 08:55:08,308 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-10-22 08:55:08,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:08,308 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-10-22 08:55:08,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:55:08,308 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-10-22 08:55:08,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:55:08,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:08,309 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:08,509 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-10-22 08:55:08,510 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:08,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:08,510 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-10-22 08:55:08,510 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:08,510 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [50935216] [2019-10-22 08:55:08,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:08,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:08,559 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 08:55:08,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:08,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:08,590 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,610 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:08,611 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:08,618 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:08,649 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:08,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:08,667 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [50935216] [2019-10-22 08:55:08,667 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:08,667 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-10-22 08:55:08,668 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214667977] [2019-10-22 08:55:08,668 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 08:55:08,668 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:08,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 08:55:08,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:55:08,669 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-10-22 08:55:08,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:08,974 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-10-22 08:55:08,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:55:08,975 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-10-22 08:55:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:08,975 INFO L225 Difference]: With dead ends: 114 [2019-10-22 08:55:08,975 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 08:55:08,976 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=226, Unknown=0, NotChecked=0, Total=306 [2019-10-22 08:55:08,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 08:55:08,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-22 08:55:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 08:55:08,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-10-22 08:55:08,987 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-10-22 08:55:08,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:08,987 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-10-22 08:55:08,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 08:55:08,987 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-10-22 08:55:08,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 08:55:08,988 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:08,988 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:09,201 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-10-22 08:55:09,201 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:09,201 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-10-22 08:55:09,201 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:09,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1172896166] [2019-10-22 08:55:09,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:09,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:09,253 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:09,264 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:09,265 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:09,280 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:09,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-10-22 08:55:09,291 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:09,292 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:09,294 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:09,309 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:09,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:09,327 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1172896166] [2019-10-22 08:55:09,327 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:09,327 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-10-22 08:55:09,327 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516821378] [2019-10-22 08:55:09,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:55:09,328 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:09,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:55:09,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:55:09,328 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-10-22 08:55:10,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:10,990 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-10-22 08:55:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:10,990 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-22 08:55:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:10,991 INFO L225 Difference]: With dead ends: 84 [2019-10-22 08:55:10,991 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 08:55:10,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:55:10,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 08:55:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 08:55:11,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:55:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-10-22 08:55:11,001 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-10-22 08:55:11,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:11,001 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-10-22 08:55:11,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:55:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-10-22 08:55:11,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:55:11,002 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:11,002 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:11,203 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-10-22 08:55:11,203 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:11,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:11,203 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-10-22 08:55:11,204 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:11,204 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [547399476] [2019-10-22 08:55:11,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:11,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:11,273 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:55:11,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:11,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:11,296 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:11,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:11,331 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:11,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:11,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:11,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [547399476] [2019-10-22 08:55:11,640 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:11,641 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-10-22 08:55:11,641 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144546384] [2019-10-22 08:55:11,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:55:11,641 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:11,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:55:11,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:11,642 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-10-22 08:55:11,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:11,920 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-10-22 08:55:11,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:55:11,920 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-22 08:55:11,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:11,921 INFO L225 Difference]: With dead ends: 82 [2019-10-22 08:55:11,921 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 08:55:11,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:55:11,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 08:55:11,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 08:55:11,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 08:55:11,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-10-22 08:55:11,928 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-10-22 08:55:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:11,928 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-10-22 08:55:11,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:55:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-10-22 08:55:11,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 08:55:11,929 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:11,929 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:12,137 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-10-22 08:55:12,137 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:12,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:12,138 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-10-22 08:55:12,138 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:12,138 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339935702] [2019-10-22 08:55:12,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:12,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:12,210 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 08:55:12,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:12,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:12,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:12,300 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:12,390 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:12,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:12,467 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339935702] [2019-10-22 08:55:12,467 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:12,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-10-22 08:55:12,468 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398738658] [2019-10-22 08:55:12,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 08:55:12,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:12,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:55:12,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:55:12,469 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-10-22 08:55:12,676 WARN L191 SmtUtils]: Spent 139.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-10-22 08:55:13,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:13,420 INFO L93 Difference]: Finished difference Result 154 states and 169 transitions. [2019-10-22 08:55:13,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:55:13,421 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-22 08:55:13,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:13,421 INFO L225 Difference]: With dead ends: 154 [2019-10-22 08:55:13,421 INFO L226 Difference]: Without dead ends: 134 [2019-10-22 08:55:13,422 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-10-22 08:55:13,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2019-10-22 08:55:13,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 72. [2019-10-22 08:55:13,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 08:55:13,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 87 transitions. [2019-10-22 08:55:13,425 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 87 transitions. Word has length 26 [2019-10-22 08:55:13,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:13,425 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 87 transitions. [2019-10-22 08:55:13,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 08:55:13,425 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 87 transitions. [2019-10-22 08:55:13,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 08:55:13,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:13,426 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:13,626 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-10-22 08:55:13,626 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:13,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:13,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-10-22 08:55:13,627 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:13,627 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [959137081] [2019-10-22 08:55:13,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:13,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:13,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 08:55:13,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:13,693 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:13,694 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:13,705 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:13,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:13,932 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:14,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:14,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:14,095 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [959137081] [2019-10-22 08:55:14,095 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:14,095 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-10-22 08:55:14,095 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342213212] [2019-10-22 08:55:14,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 08:55:14,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:14,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 08:55:14,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:14,096 INFO L87 Difference]: Start difference. First operand 72 states and 87 transitions. Second operand 15 states. [2019-10-22 08:55:16,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:16,787 INFO L93 Difference]: Finished difference Result 195 states and 205 transitions. [2019-10-22 08:55:16,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-10-22 08:55:16,787 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-22 08:55:16,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:16,788 INFO L225 Difference]: With dead ends: 195 [2019-10-22 08:55:16,788 INFO L226 Difference]: Without dead ends: 158 [2019-10-22 08:55:16,789 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=455, Invalid=1437, Unknown=0, NotChecked=0, Total=1892 [2019-10-22 08:55:16,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2019-10-22 08:55:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 43. [2019-10-22 08:55:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 08:55:16,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 53 transitions. [2019-10-22 08:55:16,794 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 53 transitions. Word has length 27 [2019-10-22 08:55:16,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:16,794 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 53 transitions. [2019-10-22 08:55:16,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 08:55:16,794 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 53 transitions. [2019-10-22 08:55:16,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 08:55:16,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:16,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:16,995 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-10-22 08:55:16,995 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:16,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:16,995 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-10-22 08:55:16,995 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:16,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [303440263] [2019-10-22 08:55:16,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:17,047 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 08:55:17,048 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:17,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:17,068 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:17,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:17,276 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:17,364 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:17,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:17,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [303440263] [2019-10-22 08:55:17,380 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:17,380 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-10-22 08:55:17,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512481508] [2019-10-22 08:55:17,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:55:17,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:17,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:55:17,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:17,381 INFO L87 Difference]: Start difference. First operand 43 states and 53 transitions. Second operand 12 states. [2019-10-22 08:55:18,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:18,092 INFO L93 Difference]: Finished difference Result 125 states and 140 transitions. [2019-10-22 08:55:18,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-22 08:55:18,093 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-22 08:55:18,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:18,093 INFO L225 Difference]: With dead ends: 125 [2019-10-22 08:55:18,093 INFO L226 Difference]: Without dead ends: 101 [2019-10-22 08:55:18,094 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=199, Invalid=557, Unknown=0, NotChecked=0, Total=756 [2019-10-22 08:55:18,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-10-22 08:55:18,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 41. [2019-10-22 08:55:18,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 08:55:18,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-10-22 08:55:18,098 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 28 [2019-10-22 08:55:18,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:18,098 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-10-22 08:55:18,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:55:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-10-22 08:55:18,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:55:18,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:18,098 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:18,301 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-10-22 08:55:18,301 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:18,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:18,301 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-10-22 08:55:18,302 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:18,302 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [166031074] [2019-10-22 08:55:18,302 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:18,372 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 08:55:18,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:18,383 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:18,394 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,413 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:18,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:18,523 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:18,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [166031074] [2019-10-22 08:55:18,557 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:18,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-10-22 08:55:18,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799502117] [2019-10-22 08:55:18,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:55:18,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:55:18,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:55:18,558 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-10-22 08:55:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:19,079 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-10-22 08:55:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:55:19,079 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-10-22 08:55:19,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:19,080 INFO L225 Difference]: With dead ends: 52 [2019-10-22 08:55:19,080 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 08:55:19,080 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:55:19,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 08:55:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 08:55:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 08:55:19,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-10-22 08:55:19,084 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-10-22 08:55:19,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:19,084 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-10-22 08:55:19,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:55:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-10-22 08:55:19,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 08:55:19,086 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:19,086 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:19,286 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-10-22 08:55:19,286 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:19,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:19,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-10-22 08:55:19,287 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:19,287 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1825308464] [2019-10-22 08:55:19,287 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:19,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:19,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:55:19,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:19,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:19,402 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:19,438 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:19,450 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:19,496 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:19,513 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:19,537 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:19,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1825308464] [2019-10-22 08:55:19,538 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:19,538 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-10-22 08:55:19,538 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983935585] [2019-10-22 08:55:19,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 08:55:19,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:19,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 08:55:19,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:55:19,539 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-10-22 08:55:20,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:20,125 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-10-22 08:55:20,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 08:55:20,125 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-22 08:55:20,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:20,125 INFO L225 Difference]: With dead ends: 55 [2019-10-22 08:55:20,126 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 08:55:20,126 INFO L600 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-10-22 08:55:20,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 08:55:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 08:55:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:55:20,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-22 08:55:20,130 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-10-22 08:55:20,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:20,130 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-22 08:55:20,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 08:55:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-22 08:55:20,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 08:55:20,131 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:20,131 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:20,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-10-22 08:55:20,331 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:20,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:20,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-10-22 08:55:20,332 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:20,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1088954626] [2019-10-22 08:55:20,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:20,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:20,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 08:55:20,394 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:20,430 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:20,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,492 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:20,550 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:55:20,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:20,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1088954626] [2019-10-22 08:55:20,576 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:20,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-10-22 08:55:20,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527024563] [2019-10-22 08:55:20,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 08:55:20,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:20,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 08:55:20,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:55:20,577 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-10-22 08:55:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:20,951 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-10-22 08:55:20,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:55:20,951 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-10-22 08:55:20,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:20,952 INFO L225 Difference]: With dead ends: 79 [2019-10-22 08:55:20,952 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 08:55:20,952 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-10-22 08:55:20,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 08:55:20,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-10-22 08:55:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 08:55:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-22 08:55:20,955 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-10-22 08:55:20,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:20,955 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-22 08:55:20,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 08:55:20,955 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-22 08:55:20,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 08:55:20,956 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:55:20,956 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:55:21,156 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-10-22 08:55:21,156 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:55:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:55:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-10-22 08:55:21,157 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:55:21,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759059707] [2019-10-22 08:55:21,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/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-10-22 08:55:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:55:21,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:55:21,235 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:55:21,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:21,243 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:55:21,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:55:21,245 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759059707] [2019-10-22 08:55:21,245 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:55:21,245 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 08:55:21,245 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940064555] [2019-10-22 08:55:21,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:55:21,246 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:55:21,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:55:21,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:55:21,246 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-10-22 08:55:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:55:21,272 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-22 08:55:21,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:55:21,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 08:55:21,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:55:21,272 INFO L225 Difference]: With dead ends: 39 [2019-10-22 08:55:21,272 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:55:21,273 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:55:21,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:55:21,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:55:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:55:21,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:55:21,273 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-10-22 08:55:21,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:55:21,273 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:55:21,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:55:21,273 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:55:21,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:55:21,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-10-22 08:55:21,477 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:55:21,652 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 87 [2019-10-22 08:55:22,441 WARN L191 SmtUtils]: Spent 429.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 38 [2019-10-22 08:55:22,917 WARN L191 SmtUtils]: Spent 474.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 27 [2019-10-22 08:55:23,275 WARN L191 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 32 [2019-10-22 08:55:23,506 WARN L191 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 24 [2019-10-22 08:55:23,714 WARN L191 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 32 [2019-10-22 08:55:24,007 WARN L191 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 32 [2019-10-22 08:55:24,426 WARN L191 SmtUtils]: Spent 418.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 42 [2019-10-22 08:55:24,831 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 35 [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L68-3(lines 68 69) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L68-5(lines 68 84) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L68-7(lines 68 84) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L69(line 69) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L36(lines 36 37) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L69-2(line 69) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L446 ceAbstractionStarter]: At program point L86(lines 59 87) the Hoare annotation is: true [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L29(lines 29 32) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L29-1(lines 29 32) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 39) no Hoare annotation was computed. [2019-10-22 08:55:25,004 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L80-2(lines 80 83) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L23(lines 23 32) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 32) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L81(line 81) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L15-1(lines 15 19) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L439 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-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L15-3(lines 12 33) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L15-5(lines 15 19) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L439 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-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 75) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L15-7(lines 12 33) no Hoare annotation was computed. [2019-10-22 08:55:25,005 INFO L439 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-10-22 08:55:25,005 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L439 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-10-22 08:55:25,006 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-22 08:55:25,006 INFO L443 ceAbstractionStarter]: For program point L41(line 41) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point L74-2(lines 74 77) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point L41-2(line 41) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L439 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-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point L75(line 75) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 32) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point L26-1(lines 26 32) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-10-22 08:55:25,007 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 81) no Hoare annotation was computed. [2019-10-22 08:55:25,029 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:55:25 BoogieIcfgContainer [2019-10-22 08:55:25,029 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:55:25,030 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:55:25,030 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:55:25,030 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:55:25,031 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:55:02" (3/4) ... [2019-10-22 08:55:25,041 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:55:25,059 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-10-22 08:55:25,059 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 08:55:25,059 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:55:25,083 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-10-22 08:55:25,083 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-10-22 08:55:25,084 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-10-22 08:55:25,084 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-10-22 08:55:25,084 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-10-22 08:55:25,084 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-10-22 08:55:25,084 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-10-22 08:55:25,085 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-10-22 08:55:25,085 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-10-22 08:55:25,085 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-10-22 08:55:25,085 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-10-22 08:55:25,085 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-10-22 08:55:25,086 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-10-22 08:55:25,118 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_3375b3c6-571d-4e98-ac0f-d2745ffbbf8f/bin/uautomizer/witness.graphml [2019-10-22 08:55:25,118 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:55:25,119 INFO L168 Benchmark]: Toolchain (without parser) took 23319.06 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 344.5 MB). Free memory was 952.4 MB in the beginning and 1.0 GB in the end (delta: -51.6 MB). Peak memory consumption was 292.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:25,120 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:55:25,120 INFO L168 Benchmark]: CACSL2BoogieTranslator took 243.26 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:25,120 INFO L168 Benchmark]: Boogie Procedure Inliner took 92.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 936.2 MB in the beginning and 1.2 GB in the end (delta: -223.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:25,121 INFO L168 Benchmark]: Boogie Preprocessor took 52.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:25,121 INFO L168 Benchmark]: RCFGBuilder took 370.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:25,121 INFO L168 Benchmark]: TraceAbstraction took 22466.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.1 MB). Peak memory consumption was 404.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:25,121 INFO L168 Benchmark]: Witness Printer took 88.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:55:25,123 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 977.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 243.26 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.2 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 92.60 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 936.2 MB in the beginning and 1.2 GB in the end (delta: -223.1 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.90 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 370.80 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 32.7 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 22466.59 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 180.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.1 MB). Peak memory consumption was 404.2 MB. Max. memory is 11.5 GB. * Witness Printer took 88.66 ms. Allocated memory is still 1.4 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.2 MB). Peak memory consumption was 9.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 75]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 81]: 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: 22.3s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 10.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 3.5s, HoareTripleCheckerStatistics: 1149 SDtfs, 2823 SDslu, 4377 SDs, 0 SdLazy, 1918 SolverSat, 272 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1043 GetRequests, 770 SyntacticMatches, 10 SemanticMatches, 263 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 6.4s 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, 2.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 479 NumberOfCodeBlocks, 479 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 920 ConstructedInterpolants, 31 QuantifiedInterpolants, 93793 SizeOfPredicates, 149 NumberOfNonLiveVariables, 1375 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...