./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff ................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c -s /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash df3954142d6b55c98b13b60b9fbaf053d4d402ff .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:11,142 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:11,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:11,157 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:11,157 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:11,159 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:11,160 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:11,162 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:11,164 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:11,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:11,168 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:11,169 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:11,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:11,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:11,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:11,178 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:11,178 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:11,179 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:11,180 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:11,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:11,188 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:11,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:11,192 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:11,194 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:11,195 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:11,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:11,195 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:11,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:11,196 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:11,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:11,197 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:11,198 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:11,198 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:11,199 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:11,199 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:11,202 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:11,203 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:11,203 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:11,203 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:11,204 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:11,205 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:11,206 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2019-10-22 11:24:11,218 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:11,228 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:11,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:11,229 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:11,229 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:11,230 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:11,230 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-10-22 11:24:11,230 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:11,230 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:11,230 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-10-22 11:24:11,230 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-10-22 11:24:11,230 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:11,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:11,231 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:11,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 11:24:11,233 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:11,233 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:11,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:11,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:11,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:11,234 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:11,234 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:11,234 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:11,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:11,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:11,234 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:11,235 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:11,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:11,235 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:11,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:11,235 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:11,235 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-22 11:24:11,236 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 11:24:11,236 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:11,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:11,236 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-10-22 11:24:11,271 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:11,283 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:11,291 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:11,293 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:11,293 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:11,294 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 11:24:11,341 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/3e55fa0c2/4f4d63dd7ca64f089d21874304f84a1c/FLAG90b32d085 [2019-10-22 11:24:11,747 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:11,747 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 11:24:11,755 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/3e55fa0c2/4f4d63dd7ca64f089d21874304f84a1c/FLAG90b32d085 [2019-10-22 11:24:12,142 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/3e55fa0c2/4f4d63dd7ca64f089d21874304f84a1c [2019-10-22 11:24:12,145 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:12,146 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:12,147 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:12,147 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:12,151 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:12,152 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,154 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1edf5c36 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12, skipping insertion in model container [2019-10-22 11:24:12,154 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,161 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:12,179 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:12,439 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:12,443 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:12,471 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:12,493 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:12,494 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12 WrapperNode [2019-10-22 11:24:12,494 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:12,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:12,495 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:12,495 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:12,501 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,508 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,535 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:12,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:12,537 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:12,537 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:12,545 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,546 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,548 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,555 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,565 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,566 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... [2019-10-22 11:24:12,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:12,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:12,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:12,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:12,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:12,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-10-22 11:24:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:12,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 11:24:12,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:13,035 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:13,036 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 11:24:13,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:13 BoogieIcfgContainer [2019-10-22 11:24:13,037 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:13,038 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:13,038 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:13,041 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:13,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:12" (1/3) ... [2019-10-22 11:24:13,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac364d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:13, skipping insertion in model container [2019-10-22 11:24:13,042 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:12" (2/3) ... [2019-10-22 11:24:13,042 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@ac364d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:13, skipping insertion in model container [2019-10-22 11:24:13,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:13" (3/3) ... [2019-10-22 11:24:13,044 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-10-22 11:24:13,053 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:13,060 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:24:13,067 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:24:13,087 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:13,087 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:13,087 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:13,087 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:13,087 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:13,087 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:13,089 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:13,089 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:13,102 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 11:24:13,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:13,108 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:13,109 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:13,110 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:13,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:13,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-10-22 11:24:13,120 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:13,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848703099] [2019-10-22 11:24:13,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,121 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:13,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:13,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 11:24:13,246 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848703099] [2019-10-22 11:24:13,246 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:13,247 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:13,247 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236926615] [2019-10-22 11:24:13,250 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:13,251 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:13,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:13,261 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 4 states. [2019-10-22 11:24:13,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:13,325 INFO L93 Difference]: Finished difference Result 90 states and 134 transitions. [2019-10-22 11:24:13,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:13,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-10-22 11:24:13,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:13,338 INFO L225 Difference]: With dead ends: 90 [2019-10-22 11:24:13,338 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:24:13,341 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 11:24:13,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:24:13,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 11:24:13,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:24:13,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-10-22 11:24:13,372 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 16 [2019-10-22 11:24:13,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:13,372 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-10-22 11:24:13,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:13,372 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-10-22 11:24:13,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:13,373 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:13,373 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 11:24:13,373 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:13,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:13,374 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-10-22 11:24:13,374 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:13,374 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222815736] [2019-10-22 11:24:13,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,374 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:13,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:13,427 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 11:24:13,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222815736] [2019-10-22 11:24:13,428 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:13,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 11:24:13,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897977157] [2019-10-22 11:24:13,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:13,430 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:13,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:13,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:13,430 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 4 states. [2019-10-22 11:24:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:13,474 INFO L93 Difference]: Finished difference Result 77 states and 97 transitions. [2019-10-22 11:24:13,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:13,475 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 11:24:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:13,476 INFO L225 Difference]: With dead ends: 77 [2019-10-22 11:24:13,476 INFO L226 Difference]: Without dead ends: 64 [2019-10-22 11:24:13,477 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 11:24:13,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2019-10-22 11:24:13,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2019-10-22 11:24:13,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:24:13,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 11:24:13,483 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-10-22 11:24:13,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:13,483 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 11:24:13,483 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:13,483 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-10-22 11:24:13,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:13,484 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:13,484 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 11:24:13,484 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:13,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:13,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-10-22 11:24:13,485 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:13,485 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124659639] [2019-10-22 11:24:13,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,485 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,485 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:13,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:13,554 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 11:24:13,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124659639] [2019-10-22 11:24:13,555 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:13,555 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 11:24:13,555 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413574652] [2019-10-22 11:24:13,555 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:13,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-22 11:24:13,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:13,556 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 3 states. [2019-10-22 11:24:13,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:13,608 INFO L93 Difference]: Finished difference Result 50 states and 65 transitions. [2019-10-22 11:24:13,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:13,612 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-10-22 11:24:13,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:13,613 INFO L225 Difference]: With dead ends: 50 [2019-10-22 11:24:13,613 INFO L226 Difference]: Without dead ends: 48 [2019-10-22 11:24:13,613 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 11:24:13,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-22 11:24:13,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2019-10-22 11:24:13,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-10-22 11:24:13,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2019-10-22 11:24:13,620 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 21 [2019-10-22 11:24:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:13,620 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2019-10-22 11:24:13,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:13,620 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2019-10-22 11:24:13,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:13,621 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:13,621 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 11:24:13,621 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:13,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:13,622 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-10-22 11:24:13,622 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-22 11:24:13,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156051409] [2019-10-22 11:24:13,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,622 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 11:24:13,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 11:24:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:13,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 11:24:13,762 INFO L168 tionRefinementEngine]: Strategy TAIPAN found a feasible trace [2019-10-22 11:24:13,762 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 11:24:13,789 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:13 BoogieIcfgContainer [2019-10-22 11:24:13,789 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:13,789 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:13,789 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:13,790 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:13,790 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:13" (3/4) ... [2019-10-22 11:24:13,793 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 11:24:13,793 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:13,795 INFO L168 Benchmark]: Toolchain (without parser) took 1648.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.0 MB in the beginning and 1.0 GB in the end (delta: -104.0 MB). Peak memory consumption was 34.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:13,795 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:13,796 INFO L168 Benchmark]: CACSL2BoogieTranslator took 346.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:13,796 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.64 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 11:24:13,797 INFO L168 Benchmark]: Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:13,797 INFO L168 Benchmark]: RCFGBuilder took 467.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:13,798 INFO L168 Benchmark]: TraceAbstraction took 751.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:13,798 INFO L168 Benchmark]: Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:13,801 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 963.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 346.85 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 138.4 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -192.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 41.64 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 33.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 467.27 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 751.50 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 53.7 MB). Peak memory consumption was 53.7 MB. Max. memory is 11.5 GB. * Witness Printer took 3.89 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 74]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 73. Possible FailurePath: [L64] float x = __VERIFIER_nondet_float(); [L65] float y = __VERIFIER_nondet_float(); [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L67] EXPR isnan_float(x) && !isnan_float(y) [L67-L68] (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L67-L68] COND TRUE (isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y)) [L21] __uint32_t w; [L24] ieee_float_shape_type gf_u; [L25] gf_u.value = (x) [L26] EXPR gf_u.word [L26] (w) = gf_u.word [L29] COND FALSE !(w == 0x00000000 || w == 0x80000000) [L31-L32] COND FALSE !((w >= 0x00800000 && w <= 0x7f7fffff) || (w >= 0x80800000 && w <= 0xff7fffff)) [L34-L35] COND FALSE !((w >= 0x00000001 && w <= 0x007fffff) || (w >= 0x80000001 && w <= 0x807fffff)) [L37] COND FALSE !(w == 0x7f800000 || w == 0xff800000) [L40] return 0; [L44] COND TRUE __fpclassify_float(x) == 0 [L45] return y; [L70] float res = fmax_float(x, y); [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L55] return x != x; [L73] EXPR isnan_float(x) && !isnan_float(y) [L73] COND TRUE isnan_float(x) && !isnan_float(y) && res != y [L74] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 189 SDtfs, 37 SDslu, 269 SDs, 0 SdLazy, 42 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=48occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 22 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 52 ConstructedInterpolants, 0 QuantifiedInterpolants, 1032 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-cad4683 [2019-10-22 11:24:15,775 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 11:24:15,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 11:24:15,785 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 11:24:15,785 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 11:24:15,786 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 11:24:15,787 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 11:24:15,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 11:24:15,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 11:24:15,790 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 11:24:15,790 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 11:24:15,791 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 11:24:15,791 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 11:24:15,792 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 11:24:15,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 11:24:15,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 11:24:15,794 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 11:24:15,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 11:24:15,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 11:24:15,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 11:24:15,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 11:24:15,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 11:24:15,800 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 11:24:15,801 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 11:24:15,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 11:24:15,803 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 11:24:15,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 11:24:15,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 11:24:15,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 11:24:15,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 11:24:15,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 11:24:15,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 11:24:15,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 11:24:15,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 11:24:15,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 11:24:15,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 11:24:15,808 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 11:24:15,808 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 11:24:15,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 11:24:15,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 11:24:15,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 11:24:15,810 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/config/svcomp-Reach-32bit-Taipan_Bitvector.epf [2019-10-22 11:24:15,821 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 11:24:15,821 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 11:24:15,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-22 11:24:15,822 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-22 11:24:15,822 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-22 11:24:15,822 INFO L138 SettingsManager]: * Explicit value domain=true [2019-10-22 11:24:15,822 INFO L138 SettingsManager]: * Octagon Domain=false [2019-10-22 11:24:15,822 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-10-22 11:24:15,822 INFO L138 SettingsManager]: * Interval Domain=false [2019-10-22 11:24:15,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 11:24:15,823 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 11:24:15,823 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 11:24:15,823 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 11:24:15,823 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 11:24:15,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 11:24:15,824 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 11:24:15,824 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 11:24:15,824 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 11:24:15,824 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 11:24:15,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 11:24:15,825 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 11:24:15,825 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 11:24:15,825 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 11:24:15,825 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 11:24:15,825 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 11:24:15,825 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 11:24:15,826 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 11:24:15,826 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 11:24:15,826 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 11:24:15,826 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 11:24:15,826 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-10-22 11:24:15,826 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 11:24:15,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 11:24:15,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 11:24:15,827 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_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan 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 -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> df3954142d6b55c98b13b60b9fbaf053d4d402ff [2019-10-22 11:24:15,852 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 11:24:15,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 11:24:15,865 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 11:24:15,866 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 11:24:15,866 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 11:24:15,867 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/../../sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 11:24:15,916 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/606ef9375/7a648f190d5a491983f7105a2e4753e7/FLAG2f5e6de04 [2019-10-22 11:24:16,301 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 11:24:16,302 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/sv-benchmarks/c/float-newlib/float_req_bl_1251.c [2019-10-22 11:24:16,306 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/606ef9375/7a648f190d5a491983f7105a2e4753e7/FLAG2f5e6de04 [2019-10-22 11:24:16,708 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/data/606ef9375/7a648f190d5a491983f7105a2e4753e7 [2019-10-22 11:24:16,710 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 11:24:16,712 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 11:24:16,713 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:16,713 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 11:24:16,716 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 11:24:16,717 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:16,719 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6461cede and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16, skipping insertion in model container [2019-10-22 11:24:16,719 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:16,726 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 11:24:16,740 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 11:24:16,890 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:16,894 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 11:24:16,918 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 11:24:16,939 INFO L192 MainTranslator]: Completed translation [2019-10-22 11:24:16,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16 WrapperNode [2019-10-22 11:24:16,940 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 11:24:16,941 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:16,941 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 11:24:16,941 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 11:24:16,999 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,011 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,034 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 11:24:17,034 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 11:24:17,034 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 11:24:17,034 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 11:24:17,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,046 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,046 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,054 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,059 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,061 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... [2019-10-22 11:24:17,064 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 11:24:17,064 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 11:24:17,064 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 11:24:17,065 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 11:24:17,065 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 11:24:17,120 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 11:24:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 11:24:17,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 11:24:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2019-10-22 11:24:17,121 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 11:24:17,485 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 11:24:17,485 INFO L284 CfgBuilder]: Removed 30 assume(true) statements. [2019-10-22 11:24:17,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17 BoogieIcfgContainer [2019-10-22 11:24:17,487 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 11:24:17,488 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 11:24:17,488 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 11:24:17,490 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 11:24:17,491 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 11:24:16" (1/3) ... [2019-10-22 11:24:17,491 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b29c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:17, skipping insertion in model container [2019-10-22 11:24:17,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 11:24:16" (2/3) ... [2019-10-22 11:24:17,492 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b29c63 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 11:24:17, skipping insertion in model container [2019-10-22 11:24:17,492 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17" (3/3) ... [2019-10-22 11:24:17,494 INFO L109 eAbstractionObserver]: Analyzing ICFG float_req_bl_1251.c [2019-10-22 11:24:17,501 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 11:24:17,507 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-10-22 11:24:17,517 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-10-22 11:24:17,537 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 11:24:17,538 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 11:24:17,538 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 11:24:17,538 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 11:24:17,538 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 11:24:17,538 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 11:24:17,538 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 11:24:17,538 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 11:24:17,549 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states. [2019-10-22 11:24:17,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 11:24:17,555 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:17,556 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:17,558 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:17,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:17,563 INFO L82 PathProgramCache]: Analyzing trace with hash 1204154757, now seen corresponding path program 1 times [2019-10-22 11:24:17,572 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:17,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103565609] [2019-10-22 11:24:17,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:17,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:17,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 11:24:17,660 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:17,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:17,673 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:17,677 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 11:24:17,678 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103565609] [2019-10-22 11:24:17,678 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:17,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 11:24:17,679 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999886234] [2019-10-22 11:24:17,683 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 11:24:17,683 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:17,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 11:24:17,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 11:24:17,697 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 2 states. [2019-10-22 11:24:17,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:17,715 INFO L93 Difference]: Finished difference Result 82 states and 122 transitions. [2019-10-22 11:24:17,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 11:24:17,716 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 16 [2019-10-22 11:24:17,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:17,726 INFO L225 Difference]: With dead ends: 82 [2019-10-22 11:24:17,726 INFO L226 Difference]: Without dead ends: 43 [2019-10-22 11:24:17,729 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 11:24:17,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-10-22 11:24:17,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2019-10-22 11:24:17,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-10-22 11:24:17,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 58 transitions. [2019-10-22 11:24:17,763 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 58 transitions. Word has length 16 [2019-10-22 11:24:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:17,763 INFO L462 AbstractCegarLoop]: Abstraction has 43 states and 58 transitions. [2019-10-22 11:24:17,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 11:24:17,763 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 58 transitions. [2019-10-22 11:24:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 11:24:17,764 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:17,764 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 11:24:17,972 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-10-22 11:24:17,972 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:17,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:17,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1262247077, now seen corresponding path program 1 times [2019-10-22 11:24:17,973 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:17,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872772857] [2019-10-22 11:24:17,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:18,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:24:18,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:18,078 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 11:24:18,078 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:18,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:18,093 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 11:24:18,093 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872772857] [2019-10-22 11:24:18,094 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:24:18,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251165078] [2019-10-22 11:24:18,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:18,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:18,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:18,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:18,096 INFO L87 Difference]: Start difference. First operand 43 states and 58 transitions. Second operand 4 states. [2019-10-22 11:24:18,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,142 INFO L93 Difference]: Finished difference Result 82 states and 111 transitions. [2019-10-22 11:24:18,143 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 11:24:18,143 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-10-22 11:24:18,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,144 INFO L225 Difference]: With dead ends: 82 [2019-10-22 11:24:18,144 INFO L226 Difference]: Without dead ends: 50 [2019-10-22 11:24:18,145 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 11:24:18,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-22 11:24:18,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 45. [2019-10-22 11:24:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-10-22 11:24:18,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 60 transitions. [2019-10-22 11:24:18,152 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 60 transitions. Word has length 17 [2019-10-22 11:24:18,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,153 INFO L462 AbstractCegarLoop]: Abstraction has 45 states and 60 transitions. [2019-10-22 11:24:18,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:18,153 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 60 transitions. [2019-10-22 11:24:18,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 11:24:18,158 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,158 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 11:24:18,359 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-10-22 11:24:18,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:18,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,360 INFO L82 PathProgramCache]: Analyzing trace with hash 44236684, now seen corresponding path program 1 times [2019-10-22 11:24:18,360 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:18,361 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957902397] [2019-10-22 11:24:18,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:18,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:24:18,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:18,458 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 11:24:18,458 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:18,481 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 11:24:18,482 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957902397] [2019-10-22 11:24:18,482 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 11:24:18,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260671903] [2019-10-22 11:24:18,483 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:18,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:18,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:18,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:18,488 INFO L87 Difference]: Start difference. First operand 45 states and 60 transitions. Second operand 6 states. [2019-10-22 11:24:18,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:18,571 INFO L93 Difference]: Finished difference Result 96 states and 120 transitions. [2019-10-22 11:24:18,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:18,572 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2019-10-22 11:24:18,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:18,573 INFO L225 Difference]: With dead ends: 96 [2019-10-22 11:24:18,573 INFO L226 Difference]: Without dead ends: 83 [2019-10-22 11:24:18,573 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 11:24:18,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2019-10-22 11:24:18,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 47. [2019-10-22 11:24:18,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-22 11:24:18,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 62 transitions. [2019-10-22 11:24:18,580 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 62 transitions. Word has length 18 [2019-10-22 11:24:18,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:18,580 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 62 transitions. [2019-10-22 11:24:18,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 62 transitions. [2019-10-22 11:24:18,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-10-22 11:24:18,581 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:18,582 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 11:24:18,782 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-10-22 11:24:18,782 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:18,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:18,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1380709804, now seen corresponding path program 1 times [2019-10-22 11:24:18,783 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:18,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312810827] [2019-10-22 11:24:18,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:18,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:24:18,846 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:18,869 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:18,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 11:24:18,932 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:18,934 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:18,972 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:18,994 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 11:24:18,995 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312810827] [2019-10-22 11:24:18,995 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:18,995 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-10-22 11:24:18,995 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718886455] [2019-10-22 11:24:18,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:18,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:18,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:18,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:18,996 INFO L87 Difference]: Start difference. First operand 47 states and 62 transitions. Second operand 10 states. [2019-10-22 11:24:19,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:19,452 INFO L93 Difference]: Finished difference Result 149 states and 197 transitions. [2019-10-22 11:24:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:19,453 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2019-10-22 11:24:19,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:19,454 INFO L225 Difference]: With dead ends: 149 [2019-10-22 11:24:19,454 INFO L226 Difference]: Without dead ends: 140 [2019-10-22 11:24:19,455 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:19,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-10-22 11:24:19,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 75. [2019-10-22 11:24:19,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2019-10-22 11:24:19,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 102 transitions. [2019-10-22 11:24:19,472 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 102 transitions. Word has length 21 [2019-10-22 11:24:19,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:19,472 INFO L462 AbstractCegarLoop]: Abstraction has 75 states and 102 transitions. [2019-10-22 11:24:19,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:19,472 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 102 transitions. [2019-10-22 11:24:19,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 11:24:19,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:19,473 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 11:24:19,681 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-10-22 11:24:19,681 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:19,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:19,682 INFO L82 PathProgramCache]: Analyzing trace with hash 147544209, now seen corresponding path program 1 times [2019-10-22 11:24:19,682 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:19,682 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [593585714] [2019-10-22 11:24:19,682 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:19,744 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:24:19,745 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:19,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:19,768 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:19,795 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:19,893 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 11:24:19,893 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:19,980 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:19,996 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:20,017 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 11:24:20,018 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [593585714] [2019-10-22 11:24:20,018 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:20,018 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 15 [2019-10-22 11:24:20,018 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950626176] [2019-10-22 11:24:20,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:24:20,019 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:20,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:24:20,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:20,020 INFO L87 Difference]: Start difference. First operand 75 states and 102 transitions. Second operand 15 states. [2019-10-22 11:24:20,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:20,861 INFO L93 Difference]: Finished difference Result 180 states and 237 transitions. [2019-10-22 11:24:20,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-22 11:24:20,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 22 [2019-10-22 11:24:20,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:20,863 INFO L225 Difference]: With dead ends: 180 [2019-10-22 11:24:20,863 INFO L226 Difference]: Without dead ends: 178 [2019-10-22 11:24:20,864 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 11:24:20,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2019-10-22 11:24:20,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 89. [2019-10-22 11:24:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:24:20,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 121 transitions. [2019-10-22 11:24:20,885 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 121 transitions. Word has length 22 [2019-10-22 11:24:20,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:20,885 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 121 transitions. [2019-10-22 11:24:20,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:24:20,885 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 121 transitions. [2019-10-22 11:24:20,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-22 11:24:20,886 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:20,886 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 11:24:21,087 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-10-22 11:24:21,087 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:21,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:21,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1845695531, now seen corresponding path program 1 times [2019-10-22 11:24:21,090 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:21,090 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148570012] [2019-10-22 11:24:21,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:21,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:21,142 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:24:21,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:21,157 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:21,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:21,224 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 11:24:21,225 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:21,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:21,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:21,244 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:21,264 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 11:24:21,264 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148570012] [2019-10-22 11:24:21,265 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:21,265 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-10-22 11:24:21,265 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428398655] [2019-10-22 11:24:21,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:21,266 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:21,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:21,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:21,266 INFO L87 Difference]: Start difference. First operand 89 states and 121 transitions. Second operand 9 states. [2019-10-22 11:24:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:21,604 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2019-10-22 11:24:21,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:24:21,605 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 23 [2019-10-22 11:24:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:21,605 INFO L225 Difference]: With dead ends: 166 [2019-10-22 11:24:21,605 INFO L226 Difference]: Without dead ends: 131 [2019-10-22 11:24:21,606 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 11:24:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2019-10-22 11:24:21,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 89. [2019-10-22 11:24:21,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:24:21,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 120 transitions. [2019-10-22 11:24:21,614 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 120 transitions. Word has length 23 [2019-10-22 11:24:21,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:21,614 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 120 transitions. [2019-10-22 11:24:21,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:21,615 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 120 transitions. [2019-10-22 11:24:21,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:21,615 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:21,616 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 11:24:21,827 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-10-22 11:24:21,827 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:21,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:21,827 INFO L82 PathProgramCache]: Analyzing trace with hash 156888005, now seen corresponding path program 1 times [2019-10-22 11:24:21,828 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:21,828 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2058002900] [2019-10-22 11:24:21,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:21,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:24:21,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:21,908 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 11:24:21,908 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:21,920 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 11:24:21,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2058002900] [2019-10-22 11:24:21,920 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:21,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 11:24:21,920 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1476227096] [2019-10-22 11:24:21,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 11:24:21,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:21,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 11:24:21,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 11:24:21,921 INFO L87 Difference]: Start difference. First operand 89 states and 120 transitions. Second operand 6 states. [2019-10-22 11:24:21,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:21,986 INFO L93 Difference]: Finished difference Result 157 states and 199 transitions. [2019-10-22 11:24:21,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 11:24:21,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-10-22 11:24:21,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:21,988 INFO L225 Difference]: With dead ends: 157 [2019-10-22 11:24:21,988 INFO L226 Difference]: Without dead ends: 141 [2019-10-22 11:24:21,989 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 11:24:21,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2019-10-22 11:24:21,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 93. [2019-10-22 11:24:21,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 11:24:21,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-10-22 11:24:21,998 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-10-22 11:24:21,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:21,998 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 11:24:21,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 11:24:21,998 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-10-22 11:24:21,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-10-22 11:24:21,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:21,999 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 11:24:22,200 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-10-22 11:24:22,200 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:22,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:22,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1621213116, now seen corresponding path program 1 times [2019-10-22 11:24:22,201 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:22,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [919651528] [2019-10-22 11:24:22,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:22,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:22,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 11:24:22,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:22,285 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 11:24:22,285 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:22,287 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 11:24:22,287 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [919651528] [2019-10-22 11:24:22,287 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:22,287 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-10-22 11:24:22,287 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565502361] [2019-10-22 11:24:22,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 11:24:22,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:22,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 11:24:22,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 11:24:22,288 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 3 states. [2019-10-22 11:24:22,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:22,311 INFO L93 Difference]: Finished difference Result 96 states and 127 transitions. [2019-10-22 11:24:22,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 11:24:22,312 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-10-22 11:24:22,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:22,313 INFO L225 Difference]: With dead ends: 96 [2019-10-22 11:24:22,313 INFO L226 Difference]: Without dead ends: 94 [2019-10-22 11:24:22,313 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 11:24:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-10-22 11:24:22,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2019-10-22 11:24:22,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-10-22 11:24:22,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 124 transitions. [2019-10-22 11:24:22,325 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 124 transitions. Word has length 24 [2019-10-22 11:24:22,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:22,325 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 124 transitions. [2019-10-22 11:24:22,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 11:24:22,326 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 124 transitions. [2019-10-22 11:24:22,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:22,326 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:22,327 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 11:24:22,538 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-10-22 11:24:22,538 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:22,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:22,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1741974657, now seen corresponding path program 1 times [2019-10-22 11:24:22,538 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:22,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991011653] [2019-10-22 11:24:22,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:22,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:24:22,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:22,641 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:22,665 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:22,684 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 11:24:22,684 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:22,686 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:22,718 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:22,740 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 11:24:22,740 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991011653] [2019-10-22 11:24:22,740 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:22,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 10 [2019-10-22 11:24:22,741 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953187712] [2019-10-22 11:24:22,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:22,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:22,741 INFO L87 Difference]: Start difference. First operand 93 states and 124 transitions. Second operand 10 states. [2019-10-22 11:24:23,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:23,029 INFO L93 Difference]: Finished difference Result 131 states and 173 transitions. [2019-10-22 11:24:23,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 11:24:23,030 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 25 [2019-10-22 11:24:23,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:23,031 INFO L225 Difference]: With dead ends: 131 [2019-10-22 11:24:23,031 INFO L226 Difference]: Without dead ends: 118 [2019-10-22 11:24:23,031 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 11:24:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2019-10-22 11:24:23,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 89. [2019-10-22 11:24:23,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2019-10-22 11:24:23,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 118 transitions. [2019-10-22 11:24:23,041 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 118 transitions. Word has length 25 [2019-10-22 11:24:23,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,042 INFO L462 AbstractCegarLoop]: Abstraction has 89 states and 118 transitions. [2019-10-22 11:24:23,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:23,042 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 118 transitions. [2019-10-22 11:24:23,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:23,046 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:23,046 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 11:24:23,252 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-10-22 11:24:23,252 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:23,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:23,252 INFO L82 PathProgramCache]: Analyzing trace with hash 839729769, now seen corresponding path program 1 times [2019-10-22 11:24:23,253 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:23,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1436851455] [2019-10-22 11:24:23,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:23,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-22 11:24:23,304 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:23,314 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:23,333 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:23,354 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 11:24:23,354 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:23,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:23,358 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:23,387 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:23,405 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 11:24:23,405 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1436851455] [2019-10-22 11:24:23,405 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:23,405 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 11 [2019-10-22 11:24:23,405 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008127730] [2019-10-22 11:24:23,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-22 11:24:23,406 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-22 11:24:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-10-22 11:24:23,406 INFO L87 Difference]: Start difference. First operand 89 states and 118 transitions. Second operand 11 states. [2019-10-22 11:24:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:23,689 INFO L93 Difference]: Finished difference Result 114 states and 147 transitions. [2019-10-22 11:24:23,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:24:23,689 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 25 [2019-10-22 11:24:23,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:23,690 INFO L225 Difference]: With dead ends: 114 [2019-10-22 11:24:23,690 INFO L226 Difference]: Without dead ends: 78 [2019-10-22 11:24:23,690 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 11:24:23,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2019-10-22 11:24:23,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2019-10-22 11:24:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-10-22 11:24:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 98 transitions. [2019-10-22 11:24:23,695 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 98 transitions. Word has length 25 [2019-10-22 11:24:23,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:23,695 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 98 transitions. [2019-10-22 11:24:23,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-22 11:24:23,695 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 98 transitions. [2019-10-22 11:24:23,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-10-22 11:24:23,696 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:23,696 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 11:24:23,906 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 mathsat -unsat_core_generation=3 [2019-10-22 11:24:23,907 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:23,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:23,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1281876129, now seen corresponding path program 1 times [2019-10-22 11:24:23,907 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:23,907 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1860113160] [2019-10-22 11:24:23,907 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:23,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:23,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:24:23,967 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:23,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:23,983 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:23,998 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:24,016 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 11:24:24,016 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:24,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:24,019 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:24,036 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:24,049 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 11:24:24,049 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1860113160] [2019-10-22 11:24:24,049 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:24,049 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 9 [2019-10-22 11:24:24,049 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923670862] [2019-10-22 11:24:24,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 11:24:24,050 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:24,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 11:24:24,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-10-22 11:24:24,050 INFO L87 Difference]: Start difference. First operand 76 states and 98 transitions. Second operand 9 states. [2019-10-22 11:24:24,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:24,300 INFO L93 Difference]: Finished difference Result 84 states and 104 transitions. [2019-10-22 11:24:24,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:24,300 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2019-10-22 11:24:24,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:24,301 INFO L225 Difference]: With dead ends: 84 [2019-10-22 11:24:24,301 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 11:24:24,301 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 11:24:24,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 11:24:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 11:24:24,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:24:24,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 94 transitions. [2019-10-22 11:24:24,308 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 94 transitions. Word has length 25 [2019-10-22 11:24:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:24,308 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 94 transitions. [2019-10-22 11:24:24,309 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 11:24:24,309 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2019-10-22 11:24:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:24,309 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:24,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, 1] [2019-10-22 11:24:24,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 mathsat -unsat_core_generation=3 [2019-10-22 11:24:24,510 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:24,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:24,510 INFO L82 PathProgramCache]: Analyzing trace with hash -144403189, now seen corresponding path program 1 times [2019-10-22 11:24:24,511 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:24,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [886188028] [2019-10-22 11:24:24,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:24,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:24,581 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 11:24:24,583 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:24,600 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:24,643 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 11:24:24,644 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:24,835 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:24,902 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 11:24:24,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [886188028] [2019-10-22 11:24:24,903 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:24,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-10-22 11:24:24,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427595425] [2019-10-22 11:24:24,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:24,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:24,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:24,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:24,904 INFO L87 Difference]: Start difference. First operand 74 states and 94 transitions. Second operand 10 states. [2019-10-22 11:24:25,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:25,151 INFO L93 Difference]: Finished difference Result 82 states and 101 transitions. [2019-10-22 11:24:25,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 11:24:25,152 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 26 [2019-10-22 11:24:25,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:25,152 INFO L225 Difference]: With dead ends: 82 [2019-10-22 11:24:25,152 INFO L226 Difference]: Without dead ends: 74 [2019-10-22 11:24:25,153 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:24:25,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-10-22 11:24:25,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2019-10-22 11:24:25,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-22 11:24:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 93 transitions. [2019-10-22 11:24:25,158 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 93 transitions. Word has length 26 [2019-10-22 11:24:25,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:25,158 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 93 transitions. [2019-10-22 11:24:25,158 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:25,158 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 93 transitions. [2019-10-22 11:24:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-22 11:24:25,159 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:25,159 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 11:24:25,364 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 mathsat -unsat_core_generation=3 [2019-10-22 11:24:25,364 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:25,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:25,364 INFO L82 PathProgramCache]: Analyzing trace with hash -953749815, now seen corresponding path program 1 times [2019-10-22 11:24:25,365 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:25,365 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1216624577] [2019-10-22 11:24:25,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:25,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:25,432 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:24:25,433 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:25,459 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:25,540 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 11:24:25,540 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:25,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:25,716 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 11:24:25,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1216624577] [2019-10-22 11:24:25,716 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:25,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-10-22 11:24:25,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475665544] [2019-10-22 11:24:25,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:24:25,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:25,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:24:25,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:24:25,717 INFO L87 Difference]: Start difference. First operand 74 states and 93 transitions. Second operand 16 states. [2019-10-22 11:24:30,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:30,533 INFO L93 Difference]: Finished difference Result 224 states and 247 transitions. [2019-10-22 11:24:30,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 11:24:30,533 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 26 [2019-10-22 11:24:30,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:30,534 INFO L225 Difference]: With dead ends: 224 [2019-10-22 11:24:30,534 INFO L226 Difference]: Without dead ends: 204 [2019-10-22 11:24:30,535 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-10-22 11:24:30,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-22 11:24:30,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 82. [2019-10-22 11:24:30,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-22 11:24:30,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 101 transitions. [2019-10-22 11:24:30,542 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 101 transitions. Word has length 26 [2019-10-22 11:24:30,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:30,542 INFO L462 AbstractCegarLoop]: Abstraction has 82 states and 101 transitions. [2019-10-22 11:24:30,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:24:30,542 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 101 transitions. [2019-10-22 11:24:30,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-22 11:24:30,543 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:30,543 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 11:24:30,743 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 mathsat -unsat_core_generation=3 [2019-10-22 11:24:30,743 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:30,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:30,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1548503636, now seen corresponding path program 1 times [2019-10-22 11:24:30,744 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:30,744 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178163938] [2019-10-22 11:24:30,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:30,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:30,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-22 11:24:30,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:30,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:30,813 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:30,826 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:31,058 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 11:24:31,058 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:31,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:31,194 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:31,213 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 11:24:31,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178163938] [2019-10-22 11:24:31,213 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:31,213 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12, 12] imperfect sequences [] total 15 [2019-10-22 11:24:31,213 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818267270] [2019-10-22 11:24:31,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-22 11:24:31,214 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:31,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-22 11:24:31,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:31,214 INFO L87 Difference]: Start difference. First operand 82 states and 101 transitions. Second operand 15 states. [2019-10-22 11:24:33,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:33,297 INFO L93 Difference]: Finished difference Result 245 states and 255 transitions. [2019-10-22 11:24:33,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-10-22 11:24:33,298 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 27 [2019-10-22 11:24:33,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:33,299 INFO L225 Difference]: With dead ends: 245 [2019-10-22 11:24:33,299 INFO L226 Difference]: Without dead ends: 220 [2019-10-22 11:24:33,300 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=527, Invalid=1729, Unknown=0, NotChecked=0, Total=2256 [2019-10-22 11:24:33,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2019-10-22 11:24:33,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 72. [2019-10-22 11:24:33,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2019-10-22 11:24:33,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 85 transitions. [2019-10-22 11:24:33,309 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 85 transitions. Word has length 27 [2019-10-22 11:24:33,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:33,310 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 85 transitions. [2019-10-22 11:24:33,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-22 11:24:33,310 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 85 transitions. [2019-10-22 11:24:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-22 11:24:33,311 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:33,311 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 11:24:33,523 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 mathsat -unsat_core_generation=3 [2019-10-22 11:24:33,524 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:33,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:33,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1364791880, now seen corresponding path program 1 times [2019-10-22 11:24:33,524 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:33,524 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [811691692] [2019-10-22 11:24:33,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:33,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:33,599 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-22 11:24:33,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:33,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:33,615 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:33,851 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 11:24:33,851 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:33,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:34,012 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 11:24:34,012 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [811691692] [2019-10-22 11:24:34,013 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:34,013 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 12 [2019-10-22 11:24:34,013 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638574226] [2019-10-22 11:24:34,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:24:34,013 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:34,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:24:34,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:24:34,014 INFO L87 Difference]: Start difference. First operand 72 states and 85 transitions. Second operand 12 states. [2019-10-22 11:24:35,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:35,090 INFO L93 Difference]: Finished difference Result 187 states and 202 transitions. [2019-10-22 11:24:35,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-22 11:24:35,091 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-10-22 11:24:35,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:35,092 INFO L225 Difference]: With dead ends: 187 [2019-10-22 11:24:35,092 INFO L226 Difference]: Without dead ends: 163 [2019-10-22 11:24:35,093 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 39 SyntacticMatches, 5 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=241, Invalid=751, Unknown=0, NotChecked=0, Total=992 [2019-10-22 11:24:35,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2019-10-22 11:24:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 70. [2019-10-22 11:24:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-22 11:24:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2019-10-22 11:24:35,100 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 28 [2019-10-22 11:24:35,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:35,100 INFO L462 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2019-10-22 11:24:35,100 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:24:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2019-10-22 11:24:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-10-22 11:24:35,101 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:35,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 11:24:35,313 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 mathsat -unsat_core_generation=3 [2019-10-22 11:24:35,314 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:35,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:35,314 INFO L82 PathProgramCache]: Analyzing trace with hash -1881082413, now seen corresponding path program 1 times [2019-10-22 11:24:35,314 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:35,314 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [905746429] [2019-10-22 11:24:35,314 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:35,400 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-22 11:24:35,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:35,448 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:35,509 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 11:24:35,509 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:35,586 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:35,646 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 11:24:35,646 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [905746429] [2019-10-22 11:24:35,646 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:35,646 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9, 9] imperfect sequences [] total 16 [2019-10-22 11:24:35,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044171723] [2019-10-22 11:24:35,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 11:24:35,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:35,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 11:24:35,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2019-10-22 11:24:35,647 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand 16 states. [2019-10-22 11:24:36,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:36,373 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2019-10-22 11:24:36,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 11:24:36,374 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 29 [2019-10-22 11:24:36,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:36,374 INFO L225 Difference]: With dead ends: 129 [2019-10-22 11:24:36,374 INFO L226 Difference]: Without dead ends: 91 [2019-10-22 11:24:36,375 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=186, Invalid=464, Unknown=0, NotChecked=0, Total=650 [2019-10-22 11:24:36,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2019-10-22 11:24:36,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 41. [2019-10-22 11:24:36,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:24:36,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-10-22 11:24:36,379 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 49 transitions. Word has length 29 [2019-10-22 11:24:36,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:36,379 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-10-22 11:24:36,380 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 11:24:36,380 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 49 transitions. [2019-10-22 11:24:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:24:36,380 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:36,380 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 11:24:36,584 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2019-10-22 11:24:36,584 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:36,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:36,584 INFO L82 PathProgramCache]: Analyzing trace with hash 430789518, now seen corresponding path program 1 times [2019-10-22 11:24:36,584 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:36,585 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473922628] [2019-10-22 11:24:36,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:36,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:36,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-22 11:24:36,683 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:36,699 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:36,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:36,712 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:36,734 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 11:24:36,735 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:36,834 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:36,865 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:36,917 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 11:24:36,917 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473922628] [2019-10-22 11:24:36,918 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:36,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 10 [2019-10-22 11:24:36,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590147593] [2019-10-22 11:24:36,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 11:24:36,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:36,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 11:24:36,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-10-22 11:24:36,919 INFO L87 Difference]: Start difference. First operand 41 states and 49 transitions. Second operand 10 states. [2019-10-22 11:24:37,429 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-10-22 11:24:37,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:37,650 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2019-10-22 11:24:37,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 11:24:37,650 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 32 [2019-10-22 11:24:37,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:37,651 INFO L225 Difference]: With dead ends: 52 [2019-10-22 11:24:37,651 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:24:37,651 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2019-10-22 11:24:37,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:24:37,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2019-10-22 11:24:37,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-10-22 11:24:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 48 transitions. [2019-10-22 11:24:37,657 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 48 transitions. Word has length 32 [2019-10-22 11:24:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:37,658 INFO L462 AbstractCegarLoop]: Abstraction has 41 states and 48 transitions. [2019-10-22 11:24:37,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 11:24:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 48 transitions. [2019-10-22 11:24:37,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-22 11:24:37,659 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:37,659 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 11:24:37,872 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 mathsat -unsat_core_generation=3 [2019-10-22 11:24:37,872 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:37,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:37,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1131854096, now seen corresponding path program 1 times [2019-10-22 11:24:37,872 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:37,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483547737] [2019-10-22 11:24:37,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:37,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:37,958 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 11:24:37,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:37,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:37,982 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:38,001 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:38,058 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 11:24:38,058 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:38,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:38,140 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:38,160 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:38,185 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 11:24:38,185 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483547737] [2019-10-22 11:24:38,185 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:38,185 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 14 [2019-10-22 11:24:38,185 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523479237] [2019-10-22 11:24:38,186 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-22 11:24:38,186 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:38,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-22 11:24:38,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2019-10-22 11:24:38,186 INFO L87 Difference]: Start difference. First operand 41 states and 48 transitions. Second operand 14 states. [2019-10-22 11:24:38,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:38,702 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2019-10-22 11:24:38,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-22 11:24:38,702 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-10-22 11:24:38,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:38,703 INFO L225 Difference]: With dead ends: 55 [2019-10-22 11:24:38,703 INFO L226 Difference]: Without dead ends: 41 [2019-10-22 11:24:38,703 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=113, Invalid=349, Unknown=0, NotChecked=0, Total=462 [2019-10-22 11:24:38,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-22 11:24:38,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2019-10-22 11:24:38,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:24:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2019-10-22 11:24:38,706 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2019-10-22 11:24:38,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:38,706 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2019-10-22 11:24:38,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-22 11:24:38,708 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2019-10-22 11:24:38,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-10-22 11:24:38,708 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:38,708 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 11:24:38,909 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 mathsat -unsat_core_generation=3 [2019-10-22 11:24:38,909 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:38,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1713269395, now seen corresponding path program 1 times [2019-10-22 11:24:38,909 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:38,909 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1706549853] [2019-10-22 11:24:38,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/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 11:24:38,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:38,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-22 11:24:38,981 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:38,995 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:39,047 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 11:24:39,047 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:39,107 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 11:24:39,144 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 11:24:39,144 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1706549853] [2019-10-22 11:24:39,145 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:39,145 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7, 7] imperfect sequences [] total 12 [2019-10-22 11:24:39,145 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289064499] [2019-10-22 11:24:39,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-22 11:24:39,145 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:39,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-22 11:24:39,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-10-22 11:24:39,146 INFO L87 Difference]: Start difference. First operand 39 states and 42 transitions. Second operand 12 states. [2019-10-22 11:24:39,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:39,545 INFO L93 Difference]: Finished difference Result 79 states and 81 transitions. [2019-10-22 11:24:39,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 11:24:39,545 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2019-10-22 11:24:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:39,546 INFO L225 Difference]: With dead ends: 79 [2019-10-22 11:24:39,546 INFO L226 Difference]: Without dead ends: 61 [2019-10-22 11:24:39,546 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 11:24:39,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-10-22 11:24:39,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 39. [2019-10-22 11:24:39,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-22 11:24:39,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2019-10-22 11:24:39,551 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 33 [2019-10-22 11:24:39,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:39,551 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2019-10-22 11:24:39,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-22 11:24:39,551 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2019-10-22 11:24:39,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-22 11:24:39,552 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 11:24:39,552 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 11:24:39,764 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 mathsat -unsat_core_generation=3 [2019-10-22 11:24:39,764 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 11:24:39,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 11:24:39,764 INFO L82 PathProgramCache]: Analyzing trace with hash 739407273, now seen corresponding path program 1 times [2019-10-22 11:24:39,764 INFO L157 tionRefinementEngine]: Executing refinement strategy WALRUS [2019-10-22 11:24:39,764 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289009954] [2019-10-22 11:24:39,764 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/mathsat Starting monitored process 21 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with mathsat -unsat_core_generation=3 [2019-10-22 11:24:39,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 11:24:39,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 11:24:39,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 11:24:39,840 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 11:24:39,840 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 11:24:39,841 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 11:24:39,841 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289009954] [2019-10-22 11:24:39,841 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 11:24:39,842 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-10-22 11:24:39,842 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797968922] [2019-10-22 11:24:39,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 11:24:39,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-10-22 11:24:39,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 11:24:39,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 11:24:39,842 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand 4 states. [2019-10-22 11:24:39,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 11:24:39,860 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-10-22 11:24:39,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 11:24:39,860 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-10-22 11:24:39,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 11:24:39,860 INFO L225 Difference]: With dead ends: 39 [2019-10-22 11:24:39,860 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 11:24:39,861 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 11:24:39,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 11:24:39,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 11:24:39,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 11:24:39,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 11:24:39,861 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2019-10-22 11:24:39,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 11:24:39,862 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 11:24:39,862 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 11:24:39,862 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 11:24:39,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 11:24:40,062 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 mathsat -unsat_core_generation=3 [2019-10-22 11:24:40,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 11:24:40,327 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 84 [2019-10-22 11:24:40,453 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 115 [2019-10-22 11:24:40,838 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 79 [2019-10-22 11:24:41,473 WARN L191 SmtUtils]: Spent 617.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 37 [2019-10-22 11:24:42,129 WARN L191 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 25 [2019-10-22 11:24:42,365 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 23 [2019-10-22 11:24:42,616 WARN L191 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 31 [2019-10-22 11:24:42,959 WARN L191 SmtUtils]: Spent 341.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 34 [2019-10-22 11:24:43,234 WARN L191 SmtUtils]: Spent 274.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 32 [2019-10-22 11:24:43,965 WARN L191 SmtUtils]: Spent 730.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 36 [2019-10-22 11:24:44,242 WARN L191 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 40 [2019-10-22 11:24:44,362 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 23 [2019-10-22 11:24:44,421 INFO L446 ceAbstractionStarter]: At program point L85(lines 57 86) the Hoare annotation is: true [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point L44(lines 44 46) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point L37(lines 37 40) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 37 40) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L443 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-10-22 11:24:44,421 INFO L439 ceAbstractionStarter]: At program point L55(line 55) the Hoare annotation is: (let ((.cse0 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (or (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)))) [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L55-1(line 55) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short9| (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L55-2(line 55) the Hoare annotation is: (let ((.cse2 (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (.cse0 (not |ULTIMATE.start_main_#t~short13|)) (.cse1 (not |ULTIMATE.start_main_#t~short9|))) (or (and .cse0 .cse1 (not (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0)) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse2))) (and .cse2 .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L55-3(line 55) the Hoare annotation is: (and (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0) (not |ULTIMATE.start_main_#t~short13|) (not |ULTIMATE.start_main_#t~short9|) (let ((.cse0 (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0))) (or (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not .cse0)) (and .cse0 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)))) |ULTIMATE.start_main_#t~short12|) [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L55-4(line 55) the Hoare annotation is: (let ((.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse3 (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|)) (.cse4 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) .cse0 .cse1 (not (fp.eq .cse2 .cse2)) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse3 .cse4 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0)) (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y .cse2) .cse0 .cse3 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse4 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse1))) [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L55-5(line 55) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse2 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|))) (or (and (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_fmax_float_~y (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) (and |ULTIMATE.start_main_#t~short17| .cse2) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (and |ULTIMATE.start_main_#t~short17| (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~res~0) .cse2))) [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L55-6(line 55) the Hoare annotation is: (or (and (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)))) [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L55-7(line 55) the Hoare annotation is: (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (fp.eq ULTIMATE.start_main_~res~0 ULTIMATE.start_main_~x~0) (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y) (not (let ((.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (fp.eq .cse0 .cse0))) (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) [2019-10-22 11:24:44,422 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-22 11:24:44,422 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 40) no Hoare annotation was computed. [2019-10-22 11:24:44,422 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 40) no Hoare annotation was computed. [2019-10-22 11:24:44,422 INFO L443 ceAbstractionStarter]: For program point L23-1(lines 23 27) no Hoare annotation was computed. [2019-10-22 11:24:44,422 INFO L439 ceAbstractionStarter]: At program point L23-2(lines 23 27) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse0 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))) (or (and (not .cse0) (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1) (and .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L23-3(lines 20 41) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L23-5(lines 23 27) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L439 ceAbstractionStarter]: At program point L23-6(lines 23 27) the Hoare annotation is: (let ((.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse1 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x))) (or (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse0 (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1) (and .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y)))) [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L23-7(lines 20 41) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 50) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L439 ceAbstractionStarter]: At program point L40(lines 20 41) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse0 (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_fmax_float_~y))) (or (and (= ULTIMATE.start_main_~x~0 ULTIMATE.start_fmax_float_~x) (= ULTIMATE.start_fmax_float_~x ULTIMATE.start___fpclassify_float_~x) (= ULTIMATE.start_fmax_float_~x (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (and (not .cse0) (and (and (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|)) (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) .cse1) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|))) (and (and (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse1 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x))) (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|) .cse0))) [2019-10-22 11:24:44,423 INFO L439 ceAbstractionStarter]: At program point L40-1(lines 20 41) the Hoare annotation is: (let ((.cse1 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse0 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0))) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (= (_ bv0 32) |ULTIMATE.start___fpclassify_float_#res|))) (or (and (= ULTIMATE.start_fmax_float_~y .cse0) (fp.eq ULTIMATE.start_fmax_float_~y ULTIMATE.start_main_~y~0) .cse1 (not .cse2) (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0)) .cse3) (and (and (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) .cse1 (not (fp.eq .cse0 .cse0)) .cse3 (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x))) .cse2))) [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L73-2(lines 73 76) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 74) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point L74(line 74) no Hoare annotation was computed. [2019-10-22 11:24:44,423 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 40) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L67-2(line 67) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 34 40) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L67-3(lines 67 68) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L67-5(lines 67 83) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L67-7(lines 67 83) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-10-22 11:24:44,424 INFO L439 ceAbstractionStarter]: At program point L51-3(lines 43 52) the Hoare annotation is: (let ((.cse1 (not (fp.eq ULTIMATE.start_main_~x~0 ULTIMATE.start_main_~x~0))) (.cse0 (= ULTIMATE.start_main_~y~0 ULTIMATE.start_fmax_float_~y)) (.cse3 (= ULTIMATE.start_fmax_float_~y ULTIMATE.start___fpclassify_float_~x)) (.cse2 (fp ((_ extract 31 31) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 30 23) ULTIMATE.start___fpclassify_float_~w~0) ((_ extract 22 0) ULTIMATE.start___fpclassify_float_~w~0)))) (or (and (fp.eq ULTIMATE.start_main_~y~0 ULTIMATE.start_main_~y~0) (= ULTIMATE.start_main_~y~0 |ULTIMATE.start_fmax_float_#res|) .cse0 .cse1 (= (_ bv0 32) |ULTIMATE.start_isnan_float_#res|)) (and (= ULTIMATE.start_fmax_float_~y .cse2) .cse0 (not (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_fmax_float_~x)) .cse1 (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~y~0) .cse3) (and (fp.eq ULTIMATE.start_fmax_float_~x ULTIMATE.start_main_~x~0) (fp.eq |ULTIMATE.start_fmax_float_#res| ULTIMATE.start_main_~x~0) (and .cse0 .cse3) (= (_ bv1 32) |ULTIMATE.start_isnan_float_#res|) (not (fp.eq ULTIMATE.start___fpclassify_float_~x ULTIMATE.start___fpclassify_float_~x)) (not (fp.eq .cse2 .cse2))))) [2019-10-22 11:24:44,424 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-22 11:24:44,425 INFO L443 ceAbstractionStarter]: For program point L68-2(line 68) no Hoare annotation was computed. [2019-10-22 11:24:44,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 11:24:44 BoogieIcfgContainer [2019-10-22 11:24:44,448 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 11:24:44,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 11:24:44,449 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 11:24:44,449 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 11:24:44,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 11:24:17" (3/4) ... [2019-10-22 11:24:44,453 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 11:24:44,465 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2019-10-22 11:24:44,465 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-10-22 11:24:44,466 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 11:24:44,491 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 11:24:44,491 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 11:24:44,491 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) [2019-10-22 11:24:44,492 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 11:24:44,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && y == y) || ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-10-22 11:24:44,492 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((x == x && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!~fp.eq~FLOAT(y, y) && (!(0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result) || ((((!~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-10-22 11:24:44,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || (((((~fp.eq~FLOAT(x, x) && ~fp.eq~FLOAT(\result, x)) && y == y && y == x) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) [2019-10-22 11:24:44,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) || (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) [2019-10-22 11:24:44,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res)) || (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) [2019-10-22 11:24:44,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && y == y) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((1bv32 == \result && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) [2019-10-22 11:24:44,493 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) [2019-10-22 11:24:44,494 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) [2019-10-22 11:24:44,494 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && !~fp.eq~FLOAT(x, x) [2019-10-22 11:24:44,521 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_5c399b0b-9b78-41ff-82bd-b7202975e1f5/bin/utaipan/witness.graphml [2019-10-22 11:24:44,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 11:24:44,522 INFO L168 Benchmark]: Toolchain (without parser) took 27810.58 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 342.9 MB). Free memory was 951.0 MB in the beginning and 1.2 GB in the end (delta: -279.0 MB). Peak memory consumption was 63.8 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:44,522 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 11:24:44,522 INFO L168 Benchmark]: CACSL2BoogieTranslator took 227.54 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:44,523 INFO L168 Benchmark]: Boogie Procedure Inliner took 93.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:44,523 INFO L168 Benchmark]: Boogie Preprocessor took 30.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:44,523 INFO L168 Benchmark]: RCFGBuilder took 422.40 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:44,524 INFO L168 Benchmark]: TraceAbstraction took 26960.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.8 MB). Peak memory consumption was 459.9 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:44,524 INFO L168 Benchmark]: Witness Printer took 72.13 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2019-10-22 11:24:44,525 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 977.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 227.54 ms. Allocated memory is still 1.0 GB. Free memory was 951.0 MB in the beginning and 940.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 93.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.4 MB). Free memory was 940.3 MB in the beginning and 1.1 GB in the end (delta: -204.9 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 30.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 422.40 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: 26.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 26960.77 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 193.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -133.8 MB). Peak memory consumption was 459.9 MB. Max. memory is 11.5 GB. * Witness Printer took 72.13 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.6 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 74]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 43]: Loop Invariant Derived loop invariant: (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) || (((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x)) || (((((~fp.eq~FLOAT(x, x) && ~fp.eq~FLOAT(\result, x)) && y == y && y == x) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && ~fp.eq~FLOAT(\result, x)) && ~fp.eq~FLOAT(res, x)) && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: ((((~fp.eq~FLOAT(x, x) && 1bv32 == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == x) || (((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((((((y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]) && ~fp.eq~FLOAT(y, y)) && y == y) && !(0bv32 == \result)) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && y == x) || ((((((1bv32 == \result && y == y) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && y == x) && ~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && aux-isnan_float(x) && !isnan_float(y)-aux && 0bv32 == \result) && y == x) || ((((((aux-isnan_float(x) && !isnan_float(y)-aux && ~fp.eq~FLOAT(y, y)) && y == \result) && y == y) && !~fp.eq~FLOAT(x, x)) && y == res) && 0bv32 == \result) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((x == x && x == x) && x == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && (!~fp.eq~FLOAT(y, y) && (!(0bv32 == \result) && ~fp.eq~FLOAT(x, x)) && y == y) && 1bv32 == \result) || ((((!~fp.eq~FLOAT(x, x) && y == y) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: ((((((((~fp.eq~FLOAT(\result, x) && y == y) && y == x) && !~fp.eq~FLOAT(~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]), ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0]))) && ~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(res, x)) && 0bv32 == \result) && !~fp.eq~FLOAT(x, x)) || (((((~fp.eq~FLOAT(y, y) && y == \result) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && y == res)) || (((((((~fp.eq~FLOAT(res, y) && y == ~fp~LONGDOUBLE(w[31:31], w[30:23], w[22:0])) && y == y) && 1bv32 == \result) && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && ~fp.eq~FLOAT(\result, y)) && y == x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && aux-!isnan_float(x) && isnan_float(y)-aux - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (((!aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux && !aux-isnan_float(x) && !isnan_float(y)-aux) && !~fp.eq~FLOAT(y, y)) && 1bv32 == \result && !~fp.eq~FLOAT(x, x)) || (((~fp.eq~FLOAT(x, x) && !aux-(isnan_float(x) && !isnan_float(y)) || (!isnan_float(x) && isnan_float(y))-aux) && !aux-isnan_float(x) && !isnan_float(y)-aux) && 0bv32 == \result) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((!~fp.eq~FLOAT(y, y) && x == x) && x == x) && ~fp.eq~FLOAT(x, x)) && 1bv32 == \result) && y == y) || ((((y == y && !~fp.eq~FLOAT(x, x)) && !~fp.eq~FLOAT(x, x)) && 0bv32 == \result) && ~fp.eq~FLOAT(y, y)) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (aux-isnan_float(x) && !isnan_float(y)-aux && ((1bv32 == \result && !~fp.eq~FLOAT(y, y)) || (~fp.eq~FLOAT(y, y) && 0bv32 == \result))) && !~fp.eq~FLOAT(x, x) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (~fp.eq~FLOAT(x, x) && 0bv32 == \result) || (1bv32 == \result && !~fp.eq~FLOAT(x, x)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 47 locations, 2 error locations. Result: SAFE, OverallTime: 26.8s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 13.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.3s, HoareTripleCheckerStatistics: 1236 SDtfs, 3202 SDslu, 4894 SDs, 0 SdLazy, 2294 SolverSat, 304 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 7.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1117 GetRequests, 812 SyntacticMatches, 10 SemanticMatches, 295 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 7.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=93occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 754 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 14 LocationsWithAnnotation, 14 PreInvPairs, 56 NumberOfFragments, 615 HoareAnnotationTreeSize, 14 FomulaSimplifications, 4287102 FormulaSimplificationTreeSizeReduction, 0.7s HoareSimplificationTime, 14 FomulaSimplificationsInter, 30084 FormulaSimplificationTreeSizeReductionInter, 3.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 976 ConstructedInterpolants, 31 QuantifiedInterpolants, 106425 SizeOfPredicates, 159 NumberOfNonLiveVariables, 1458 ConjunctsInSsa, 200 ConjunctsInUnsatCore, 40 InterpolantComputations, 40 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...