./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 ............................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c -s /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-678e011 [2019-11-20 07:02:19,028 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:02:19,030 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:02:19,041 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:02:19,042 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:02:19,043 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:02:19,044 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:02:19,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:02:19,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:02:19,049 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:02:19,050 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:02:19,052 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:02:19,052 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:02:19,053 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:02:19,054 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:02:19,056 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:02:19,056 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:02:19,057 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:02:19,059 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:02:19,062 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:02:19,063 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:02:19,064 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:02:19,066 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:02:19,067 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:02:19,069 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:02:19,070 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:02:19,070 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:02:19,071 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:02:19,072 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:02:19,074 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:02:19,075 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:02:19,075 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:02:19,076 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:02:19,077 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:02:19,078 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:02:19,078 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:02:19,079 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:02:19,079 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:02:19,079 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:02:19,080 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:02:19,081 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:02:19,082 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 07:02:19,096 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:02:19,096 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:02:19,097 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:02:19,097 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:02:19,098 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:02:19,098 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:02:19,098 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:02:19,098 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 07:02:19,099 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:02:19,099 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:02:19,099 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:02:19,099 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:02:19,100 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:02:19,100 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:02:19,100 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:02:19,100 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:02:19,101 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:02:19,101 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:02:19,101 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:02:19,101 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:02:19,102 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:02:19,102 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:02:19,102 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:02:19,102 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:02:19,103 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:02:19,103 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 07:02:19,103 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 07:02:19,103 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:02:19,104 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-20 07:02:19,258 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:02:19,269 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:02:19,272 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:02:19,274 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:02:19,274 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:02:19,275 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-20 07:02:19,330 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/0512b7664/39007ec62a1c468684364f5d2f137924/FLAG72f3a53a9 [2019-11-20 07:02:19,739 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:02:19,741 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-20 07:02:19,747 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/0512b7664/39007ec62a1c468684364f5d2f137924/FLAG72f3a53a9 [2019-11-20 07:02:20,092 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/0512b7664/39007ec62a1c468684364f5d2f137924 [2019-11-20 07:02:20,095 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:02:20,096 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:02:20,105 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:02:20,105 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:02:20,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:02:20,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f07a7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20, skipping insertion in model container [2019-11-20 07:02:20,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,118 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:02:20,138 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:02:20,362 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:02:20,373 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:02:20,404 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:02:20,426 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:02:20,426 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20 WrapperNode [2019-11-20 07:02:20,427 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:02:20,427 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:02:20,428 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:02:20,428 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:02:20,436 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,445 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,474 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:02:20,474 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:02:20,475 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:02:20,475 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:02:20,484 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,485 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,488 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,505 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... [2019-11-20 07:02:20,508 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:02:20,509 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:02:20,509 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:02:20,509 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:02:20,511 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:02:20,597 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:02:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-20 07:02:20,598 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:02:20,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:02:20,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-20 07:02:20,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 07:02:21,082 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:02:21,082 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-20 07:02:21,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:02:21 BoogieIcfgContainer [2019-11-20 07:02:21,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:02:21,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:02:21,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:02:21,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:02:21,090 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:02:20" (1/3) ... [2019-11-20 07:02:21,091 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76050bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:02:21, skipping insertion in model container [2019-11-20 07:02:21,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:20" (2/3) ... [2019-11-20 07:02:21,092 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76050bd9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:02:21, skipping insertion in model container [2019-11-20 07:02:21,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:02:21" (3/3) ... [2019-11-20 07:02:21,094 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-20 07:02:21,105 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:02:21,117 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:02:21,131 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:02:21,170 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:02:21,171 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:02:21,173 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:02:21,173 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:02:21,173 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:02:21,173 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:02:21,174 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:02:21,174 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:02:21,194 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-20 07:02:21,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 07:02:21,205 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:21,206 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:21,206 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:21,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:21,213 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-20 07:02:21,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:21,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286002972] [2019-11-20 07:02:21,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:21,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:21,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286002972] [2019-11-20 07:02:21,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:21,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 07:02:21,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801430704] [2019-11-20 07:02:21,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 07:02:21,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:21,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 07:02:21,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 07:02:21,405 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-20 07:02:21,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:21,434 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-20 07:02:21,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 07:02:21,436 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-20 07:02:21,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:21,451 INFO L225 Difference]: With dead ends: 62 [2019-11-20 07:02:21,452 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 07:02:21,459 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 07:02:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 07:02:21,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-20 07:02:21,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 07:02:21,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-20 07:02:21,517 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-20 07:02:21,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:21,517 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-20 07:02:21,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 07:02:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-20 07:02:21,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 07:02:21,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:21,520 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:21,520 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:21,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:21,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-20 07:02:21,522 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:21,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570525425] [2019-11-20 07:02:21,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:21,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:21,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570525425] [2019-11-20 07:02:21,641 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:21,641 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:02:21,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259201653] [2019-11-20 07:02:21,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:02:21,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:21,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:02:21,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:02:21,644 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-11-20 07:02:21,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:21,742 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-11-20 07:02:21,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:02:21,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-20 07:02:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:21,744 INFO L225 Difference]: With dead ends: 53 [2019-11-20 07:02:21,744 INFO L226 Difference]: Without dead ends: 44 [2019-11-20 07:02:21,745 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:02:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-11-20 07:02:21,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-11-20 07:02:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 07:02:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-20 07:02:21,753 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-20 07:02:21,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:21,754 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-20 07:02:21,754 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:02:21,754 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-20 07:02:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:02:21,755 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:21,755 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:21,755 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:21,756 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-11-20 07:02:21,756 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:21,756 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219977669] [2019-11-20 07:02:21,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:21,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:21,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:21,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219977669] [2019-11-20 07:02:21,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:21,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-20 07:02:21,836 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575660043] [2019-11-20 07:02:21,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:02:21,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 07:02:21,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:02:21,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:02:21,838 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-11-20 07:02:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:21,908 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-11-20 07:02:21,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:02:21,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-20 07:02:21,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:21,911 INFO L225 Difference]: With dead ends: 55 [2019-11-20 07:02:21,911 INFO L226 Difference]: Without dead ends: 46 [2019-11-20 07:02:21,912 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-20 07:02:21,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-11-20 07:02:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-11-20 07:02:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 07:02:21,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-20 07:02:21,918 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-11-20 07:02:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:21,919 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-20 07:02:21,919 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:02:21,919 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-20 07:02:21,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:02:21,920 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:21,920 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:21,920 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:21,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-20 07:02:21,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 07:02:21,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092864836] [2019-11-20 07:02:21,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 07:02:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:02:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 07:02:22,005 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 07:02:22,006 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 07:02:22,037 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:02:22 BoogieIcfgContainer [2019-11-20 07:02:22,037 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:02:22,038 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:02:22,038 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:02:22,039 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:02:22,039 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:02:21" (3/4) ... [2019-11-20 07:02:22,043 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-20 07:02:22,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:02:22,045 INFO L168 Benchmark]: Toolchain (without parser) took 1948.77 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -147.8 MB). Peak memory consumption was 36.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:22,046 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:02:22,047 INFO L168 Benchmark]: CACSL2BoogieTranslator took 321.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:22,048 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:02:22,048 INFO L168 Benchmark]: Boogie Preprocessor took 34.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:22,049 INFO L168 Benchmark]: RCFGBuilder took 574.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:22,050 INFO L168 Benchmark]: TraceAbstraction took 953.07 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:22,050 INFO L168 Benchmark]: Witness Printer took 5.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:02:22,054 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 321.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 184.5 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -225.1 MB). Peak memory consumption was 23.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.73 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.4 MB). Peak memory consumption was 6.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 574.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 953.07 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: 44.5 MB). Peak memory consumption was 44.5 MB. Max. memory is 11.5 GB. * Witness Printer took 5.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 85]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someUnaryDOUBLEoperation at line 79. Possible FailurePath: [L79] double x = -0.0; [L80] double y = 0.0; [L24] __uint32_t msw, lsw; [L27] ieee_double_shape_type ew_u; [L28] ew_u.value = (x) [L29] EXPR ew_u.parts.msw [L29] (msw) = ew_u.parts.msw [L30] EXPR ew_u.parts.lsw [L30] (lsw) = ew_u.parts.lsw [L33-L34] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L36-L37] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L39-L40] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L43-L44] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L47] return 0; [L52] COND TRUE __fpclassify_double(x) == 0 [L53] return y; [L81] double res = fmax_double(x, y); [L84] EXPR res == 0.0 && __signbit_double(res) == 0 [L84] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L85] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.8s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, 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, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-678e011 [2019-11-20 07:02:24,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 07:02:24,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 07:02:24,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 07:02:24,150 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 07:02:24,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 07:02:24,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 07:02:24,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 07:02:24,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 07:02:24,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 07:02:24,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 07:02:24,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 07:02:24,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 07:02:24,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 07:02:24,164 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 07:02:24,165 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 07:02:24,166 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 07:02:24,167 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 07:02:24,169 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 07:02:24,171 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 07:02:24,173 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 07:02:24,174 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 07:02:24,175 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 07:02:24,176 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 07:02:24,179 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 07:02:24,180 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 07:02:24,180 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 07:02:24,181 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 07:02:24,182 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 07:02:24,183 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 07:02:24,183 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 07:02:24,184 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 07:02:24,185 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 07:02:24,185 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 07:02:24,187 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 07:02:24,187 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 07:02:24,188 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 07:02:24,188 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 07:02:24,188 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 07:02:24,189 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 07:02:24,190 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 07:02:24,191 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-20 07:02:24,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 07:02:24,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 07:02:24,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 07:02:24,208 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 07:02:24,208 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 07:02:24,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 07:02:24,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 07:02:24,209 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 07:02:24,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 07:02:24,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 07:02:24,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 07:02:24,210 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 07:02:24,210 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-20 07:02:24,210 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-20 07:02:24,210 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 07:02:24,211 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 07:02:24,211 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 07:02:24,211 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 07:02:24,211 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 07:02:24,212 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 07:02:24,212 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 07:02:24,212 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 07:02:24,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:02:24,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 07:02:24,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 07:02:24,213 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 07:02:24,213 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-20 07:02:24,214 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-20 07:02:24,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 07:02:24,214 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-20 07:02:24,214 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b649b8f673a0a47da0b16e77db6ba5e693ee3ba7 [2019-11-20 07:02:24,515 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 07:02:24,527 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 07:02:24,531 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 07:02:24,532 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 07:02:24,532 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 07:02:24,533 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-20 07:02:24,592 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/b5312c8f7/52b39b1d1b14457e90f2d03b548d6a5d/FLAG1192dde99 [2019-11-20 07:02:24,943 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 07:02:24,944 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/sv-benchmarks/c/float-newlib/double_req_bl_1252a.c [2019-11-20 07:02:24,951 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/b5312c8f7/52b39b1d1b14457e90f2d03b548d6a5d/FLAG1192dde99 [2019-11-20 07:02:25,330 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/data/b5312c8f7/52b39b1d1b14457e90f2d03b548d6a5d [2019-11-20 07:02:25,332 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 07:02:25,334 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 07:02:25,335 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 07:02:25,336 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 07:02:25,339 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 07:02:25,340 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,342 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ea8e81d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25, skipping insertion in model container [2019-11-20 07:02:25,343 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,350 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 07:02:25,373 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 07:02:25,594 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:02:25,599 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 07:02:25,637 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 07:02:25,666 INFO L192 MainTranslator]: Completed translation [2019-11-20 07:02:25,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25 WrapperNode [2019-11-20 07:02:25,666 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 07:02:25,667 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 07:02:25,668 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 07:02:25,668 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 07:02:25,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 07:02:25,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 07:02:25,794 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 07:02:25,794 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 07:02:25,804 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,804 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,815 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,816 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,828 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,837 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... [2019-11-20 07:02:25,841 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 07:02:25,842 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 07:02:25,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 07:02:25,848 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 07:02:25,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 07:02:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-20 07:02:25,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-20 07:02:25,922 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-20 07:02:25,922 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 07:02:25,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 07:02:25,923 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-20 07:02:26,479 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 07:02:26,480 INFO L285 CfgBuilder]: Removed 18 assume(true) statements. [2019-11-20 07:02:26,481 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:02:26 BoogieIcfgContainer [2019-11-20 07:02:26,481 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 07:02:26,482 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 07:02:26,482 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 07:02:26,485 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 07:02:26,485 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 07:02:25" (1/3) ... [2019-11-20 07:02:26,485 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e87474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:02:26, skipping insertion in model container [2019-11-20 07:02:26,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 07:02:25" (2/3) ... [2019-11-20 07:02:26,486 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27e87474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 07:02:26, skipping insertion in model container [2019-11-20 07:02:26,486 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:02:26" (3/3) ... [2019-11-20 07:02:26,488 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1252a.c [2019-11-20 07:02:26,497 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 07:02:26,504 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-20 07:02:26,515 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-20 07:02:26,539 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 07:02:26,540 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 07:02:26,540 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 07:02:26,540 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 07:02:26,540 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 07:02:26,541 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 07:02:26,541 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 07:02:26,541 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 07:02:26,556 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-11-20 07:02:26,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-20 07:02:26,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:26,563 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:26,563 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:26,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:26,569 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-11-20 07:02:26,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:26,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [153117504] [2019-11-20 07:02:26,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:26,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:26,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-20 07:02:26,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:26,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:26,688 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:26,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:26,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [153117504] [2019-11-20 07:02:26,693 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:26,693 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-20 07:02:26,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350828914] [2019-11-20 07:02:26,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-20 07:02:26,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:26,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-20 07:02:26,712 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 07:02:26,714 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-11-20 07:02:26,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:26,732 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-11-20 07:02:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-20 07:02:26,734 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-20 07:02:26,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:26,743 INFO L225 Difference]: With dead ends: 62 [2019-11-20 07:02:26,743 INFO L226 Difference]: Without dead ends: 29 [2019-11-20 07:02:26,747 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-20 07:02:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-20 07:02:26,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-20 07:02:26,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-20 07:02:26,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-11-20 07:02:26,782 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-11-20 07:02:26,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:26,783 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-11-20 07:02:26,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-20 07:02:26,783 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-11-20 07:02:26,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-20 07:02:26,784 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:26,784 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:26,989 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-20 07:02:26,989 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:26,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:26,989 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-11-20 07:02:26,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:26,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048991079] [2019-11-20 07:02:26,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:27,072 INFO L255 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:02:27,075 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:27,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:27,113 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:27,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:27,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048991079] [2019-11-20 07:02:27,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:27,209 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:02:27,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236089485] [2019-11-20 07:02:27,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:02:27,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:27,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:02:27,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:02:27,211 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-11-20 07:02:27,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:27,342 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-11-20 07:02:27,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:02:27,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-11-20 07:02:27,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:27,344 INFO L225 Difference]: With dead ends: 68 [2019-11-20 07:02:27,344 INFO L226 Difference]: Without dead ends: 59 [2019-11-20 07:02:27,345 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:02:27,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-11-20 07:02:27,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-11-20 07:02:27,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-20 07:02:27,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-11-20 07:02:27,353 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-11-20 07:02:27,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:27,354 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-20 07:02:27,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:02:27,354 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-11-20 07:02:27,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-20 07:02:27,355 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:27,355 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:27,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-20 07:02:27,577 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:27,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:27,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-11-20 07:02:27,578 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:27,578 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1977947673] [2019-11-20 07:02:27,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:27,664 INFO L255 TraceCheckSpWp]: Trace formula consists of 48 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 07:02:27,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:27,733 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:27,758 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:02:27,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:27,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1977947673] [2019-11-20 07:02:27,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:27,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:02:27,832 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267820991] [2019-11-20 07:02:27,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:02:27,833 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:27,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:02:27,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:02:27,834 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-11-20 07:02:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:27,966 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-11-20 07:02:27,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-20 07:02:27,967 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-11-20 07:02:27,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:27,968 INFO L225 Difference]: With dead ends: 52 [2019-11-20 07:02:27,969 INFO L226 Difference]: Without dead ends: 28 [2019-11-20 07:02:27,969 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-20 07:02:27,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-20 07:02:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-11-20 07:02:27,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-20 07:02:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-11-20 07:02:27,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-11-20 07:02:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:27,975 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-20 07:02:27,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:02:27,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-11-20 07:02:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-20 07:02:27,976 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:27,977 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:28,177 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-20 07:02:28,177 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:28,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:28,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-11-20 07:02:28,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:28,179 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504664997] [2019-11-20 07:02:28,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:28,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:28,287 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-20 07:02:28,289 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:28,307 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:28,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:28,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504664997] [2019-11-20 07:02:28,328 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:28,328 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-11-20 07:02:28,328 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827121935] [2019-11-20 07:02:28,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 07:02:28,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:28,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 07:02:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-20 07:02:28,330 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-11-20 07:02:28,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:28,442 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-11-20 07:02:28,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 07:02:28,443 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-11-20 07:02:28,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:28,444 INFO L225 Difference]: With dead ends: 65 [2019-11-20 07:02:28,444 INFO L226 Difference]: Without dead ends: 56 [2019-11-20 07:02:28,445 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:02:28,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-11-20 07:02:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-11-20 07:02:28,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 07:02:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-11-20 07:02:28,452 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-11-20 07:02:28,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:28,454 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-11-20 07:02:28,454 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 07:02:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-11-20 07:02:28,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:02:28,456 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:28,456 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:28,665 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-20 07:02:28,665 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:28,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:28,665 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-11-20 07:02:28,666 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:28,666 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [293498943] [2019-11-20 07:02:28,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:28,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:28,749 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-20 07:02:28,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:28,767 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:28,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:28,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [293498943] [2019-11-20 07:02:28,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:28,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-11-20 07:02:28,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40192301] [2019-11-20 07:02:28,810 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-20 07:02:28,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:28,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-20 07:02:28,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:02:28,811 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-11-20 07:02:28,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:28,830 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-11-20 07:02:28,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 07:02:28,833 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-20 07:02:28,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:28,835 INFO L225 Difference]: With dead ends: 40 [2019-11-20 07:02:28,835 INFO L226 Difference]: Without dead ends: 30 [2019-11-20 07:02:28,835 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-20 07:02:28,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-20 07:02:28,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-20 07:02:28,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-20 07:02:28,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-11-20 07:02:28,843 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-11-20 07:02:28,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:28,844 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-20 07:02:28,844 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-20 07:02:28,844 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-11-20 07:02:28,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-20 07:02:28,845 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:28,845 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:29,049 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-20 07:02:29,049 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:29,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:29,050 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-11-20 07:02:29,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:29,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364140119] [2019-11-20 07:02:29,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:29,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:29,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-20 07:02:29,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:29,263 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:29,264 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:29,266 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:02:29,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:29,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364140119] [2019-11-20 07:02:29,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:29,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-20 07:02:29,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255945255] [2019-11-20 07:02:29,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-20 07:02:29,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:29,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-20 07:02:29,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-20 07:02:29,333 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-11-20 07:02:29,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:29,497 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-11-20 07:02:29,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-20 07:02:29,498 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-11-20 07:02:29,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:29,499 INFO L225 Difference]: With dead ends: 42 [2019-11-20 07:02:29,499 INFO L226 Difference]: Without dead ends: 39 [2019-11-20 07:02:29,500 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-11-20 07:02:29,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-11-20 07:02:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-11-20 07:02:29,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-20 07:02:29,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-20 07:02:29,506 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-11-20 07:02:29,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:29,506 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-20 07:02:29,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-20 07:02:29,507 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-20 07:02:29,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-20 07:02:29,508 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:29,508 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:29,729 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-11-20 07:02:29,730 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:29,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:29,731 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-11-20 07:02:29,731 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:29,732 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [344578273] [2019-11-20 07:02:29,732 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:29,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:29,865 INFO L255 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-20 07:02:29,867 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:29,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:29,915 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:30,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:30,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [344578273] [2019-11-20 07:02:30,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:30,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-20 07:02:30,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516951741] [2019-11-20 07:02:30,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-20 07:02:30,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:30,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-20 07:02:30,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-20 07:02:30,009 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-11-20 07:02:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:30,149 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-11-20 07:02:30,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-20 07:02:30,151 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-11-20 07:02:30,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:30,152 INFO L225 Difference]: With dead ends: 45 [2019-11-20 07:02:30,152 INFO L226 Difference]: Without dead ends: 27 [2019-11-20 07:02:30,153 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-11-20 07:02:30,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-20 07:02:30,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-20 07:02:30,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-20 07:02:30,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-20 07:02:30,159 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-11-20 07:02:30,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:30,160 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-20 07:02:30,160 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-20 07:02:30,160 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-20 07:02:30,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-20 07:02:30,161 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 07:02:30,161 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 07:02:30,377 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-11-20 07:02:30,377 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 07:02:30,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 07:02:30,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-11-20 07:02:30,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-20 07:02:30,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [61000228] [2019-11-20 07:02:30,379 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-11-20 07:02:30,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 07:02:30,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 15 conjunts are in the unsatisfiable core [2019-11-20 07:02:30,504 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-20 07:02:30,574 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:02:30,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:30,615 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-20 07:02:30,616 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-20 07:02:30,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 07:02:30,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [61000228] [2019-11-20 07:02:30,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-20 07:02:30,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-11-20 07:02:30,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350026000] [2019-11-20 07:02:30,833 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-11-20 07:02:30,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-20 07:02:30,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-20 07:02:30,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-11-20 07:02:30,834 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-11-20 07:02:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 07:02:31,099 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-11-20 07:02:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-20 07:02:31,100 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-11-20 07:02:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 07:02:31,100 INFO L225 Difference]: With dead ends: 27 [2019-11-20 07:02:31,100 INFO L226 Difference]: Without dead ends: 0 [2019-11-20 07:02:31,101 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-11-20 07:02:31,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-20 07:02:31,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-20 07:02:31,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-20 07:02:31,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-20 07:02:31,102 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-20 07:02:31,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 07:02:31,102 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-20 07:02:31,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-11-20 07:02:31,103 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-20 07:02:31,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-20 07:02:31,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-11-20 07:02:31,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-20 07:02:31,693 INFO L444 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-11-20 07:02:31,693 INFO L444 ceAbstractionStarter]: For program point L52(lines 52 53) no Hoare annotation was computed. [2019-11-20 07:02:31,693 INFO L440 ceAbstractionStarter]: At program point L69(lines 60 70) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (exists ((v_skolemized_v_prenex_5_3 (_ BitVec 64))) (and (= ULTIMATE.start___signbit_double_~msw~1 ((_ extract 63 32) v_skolemized_v_prenex_5_3)) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_skolemized_v_prenex_5_3) ((_ extract 62 52) v_skolemized_v_prenex_5_3) ((_ extract 51 0) v_skolemized_v_prenex_5_3))))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-20 07:02:31,694 INFO L444 ceAbstractionStarter]: For program point L36(lines 36 47) no Hoare annotation was computed. [2019-11-20 07:02:31,694 INFO L444 ceAbstractionStarter]: For program point L36-1(lines 36 47) no Hoare annotation was computed. [2019-11-20 07:02:31,694 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-20 07:02:31,694 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-20 07:02:31,694 INFO L444 ceAbstractionStarter]: For program point L54(lines 54 55) no Hoare annotation was computed. [2019-11-20 07:02:31,694 INFO L444 ceAbstractionStarter]: For program point L63-1(lines 63 67) no Hoare annotation was computed. [2019-11-20 07:02:31,694 INFO L440 ceAbstractionStarter]: At program point L63-2(lines 63 67) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start___signbit_double_~x) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start_main_~res~0 (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-20 07:02:31,694 INFO L444 ceAbstractionStarter]: For program point L63-3(lines 63 67) no Hoare annotation was computed. [2019-11-20 07:02:31,695 INFO L440 ceAbstractionStarter]: At program point L47(lines 23 48) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_2_3) ((_ extract 62 52) v_skolemized_v_prenex_2_3) ((_ extract 51 0) v_skolemized_v_prenex_2_3)) (fp.neg (_ +zero 11 53))))) (= ULTIMATE.start_fmax_double_~x .cse0) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-20 07:02:31,695 INFO L440 ceAbstractionStarter]: At program point L47-1(lines 23 48) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-20 07:02:31,695 INFO L444 ceAbstractionStarter]: For program point L39(lines 39 47) no Hoare annotation was computed. [2019-11-20 07:02:31,695 INFO L444 ceAbstractionStarter]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2019-11-20 07:02:31,695 INFO L447 ceAbstractionStarter]: At program point L89(lines 72 90) the Hoare annotation is: true [2019-11-20 07:02:31,695 INFO L444 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-20 07:02:31,695 INFO L444 ceAbstractionStarter]: For program point L57(line 57) no Hoare annotation was computed. [2019-11-20 07:02:31,696 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 85) no Hoare annotation was computed. [2019-11-20 07:02:31,696 INFO L444 ceAbstractionStarter]: For program point L57-2(line 57) no Hoare annotation was computed. [2019-11-20 07:02:31,696 INFO L440 ceAbstractionStarter]: At program point L57-3(lines 50 58) the Hoare annotation is: (and (exists ((|v_skolemized_q#valueAsBitvector_7| (_ BitVec 64))) (and (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_7|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_7|)) (_ +zero 11 53)) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= |ULTIMATE.start_fmax_double_#res| (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-20 07:02:31,696 INFO L444 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-20 07:02:31,697 INFO L444 ceAbstractionStarter]: For program point L26-1(lines 26 31) no Hoare annotation was computed. [2019-11-20 07:02:31,697 INFO L440 ceAbstractionStarter]: At program point L26-2(lines 26 31) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmax_double_~x .cse0) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x .cse0))) [2019-11-20 07:02:31,697 INFO L444 ceAbstractionStarter]: For program point L26-3(lines 23 48) no Hoare annotation was computed. [2019-11-20 07:02:31,698 INFO L444 ceAbstractionStarter]: For program point L26-5(lines 26 31) no Hoare annotation was computed. [2019-11-20 07:02:31,698 INFO L440 ceAbstractionStarter]: At program point L26-6(lines 26 31) the Hoare annotation is: (and (= ULTIMATE.start_fmax_double_~x (fp.neg (_ +zero 11 53))) (= ULTIMATE.start_fmax_double_~y (_ +zero 11 53)) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-11-20 07:02:31,698 INFO L444 ceAbstractionStarter]: For program point L84(line 84) no Hoare annotation was computed. [2019-11-20 07:02:31,698 INFO L444 ceAbstractionStarter]: For program point L26-7(lines 23 48) no Hoare annotation was computed. [2019-11-20 07:02:31,698 INFO L444 ceAbstractionStarter]: For program point L84-2(lines 84 87) no Hoare annotation was computed. [2019-11-20 07:02:31,699 INFO L444 ceAbstractionStarter]: For program point L43(lines 43 47) no Hoare annotation was computed. [2019-11-20 07:02:31,699 INFO L444 ceAbstractionStarter]: For program point L43-1(lines 43 47) no Hoare annotation was computed. [2019-11-20 07:02:31,704 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,705 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,706 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,717 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,719 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,720 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,723 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,725 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,726 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,727 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,728 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,731 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,732 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,733 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,734 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,735 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,736 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,737 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,738 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,743 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,744 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,745 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,746 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,747 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,748 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,758 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,759 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 07:02:31 BoogieIcfgContainer [2019-11-20 07:02:31,762 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 07:02:31,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 07:02:31,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 07:02:31,763 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 07:02:31,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 07:02:26" (3/4) ... [2019-11-20 07:02:31,766 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-20 07:02:31,777 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-11-20 07:02:31,778 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-11-20 07:02:31,778 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-20 07:02:31,803 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-11-20 07:02:31,803 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-20 07:02:31,804 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() [2019-11-20 07:02:31,804 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]))) && x == ~Pluszero~LONGDOUBLE() [2019-11-20 07:02:31,804 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() [2019-11-20 07:02:31,840 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_8d0257ca-f50e-4f6a-b3c2-4d9cdbad2848/bin/uautomizer/witness.graphml [2019-11-20 07:02:31,840 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 07:02:31,842 INFO L168 Benchmark]: Toolchain (without parser) took 6508.04 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 960.4 MB in the beginning and 1.2 GB in the end (delta: -205.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:02:31,842 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:02:31,843 INFO L168 Benchmark]: CACSL2BoogieTranslator took 331.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 944.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:31,844 INFO L168 Benchmark]: Boogie Procedure Inliner took 125.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:31,844 INFO L168 Benchmark]: Boogie Preprocessor took 47.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 07:02:31,844 INFO L168 Benchmark]: RCFGBuilder took 639.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:31,845 INFO L168 Benchmark]: TraceAbstraction took 5280.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.6 MB). Peak memory consumption was 295.8 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:31,845 INFO L168 Benchmark]: Witness Printer took 78.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. [2019-11-20 07:02:31,848 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 987.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 331.65 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 944.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 125.78 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 944.3 MB in the beginning and 1.1 GB in the end (delta: -172.6 MB). Peak memory consumption was 10.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.87 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 639.20 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 27.0 MB). Peak memory consumption was 27.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5280.34 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 65.0 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -83.6 MB). Peak memory consumption was 295.8 MB. Max. memory is 11.5 GB. * Witness Printer took 78.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 85]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 07:02:31,865 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,866 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-11-20 07:02:31,867 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: v_skolemized_v_prenex_2_3[63:32] == msw && ~fp~LONGDOUBLE(v_skolemized_v_prenex_2_3[63:63], v_skolemized_v_prenex_2_3[62:52], v_skolemized_v_prenex_2_3[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && !(0bv32 == \result)) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 60]: Loop Invariant [2019-11-20 07:02:31,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,868 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,869 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,870 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-11-20 07:02:31,871 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] Derived loop invariant: (((((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && \result == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_skolemized_v_prenex_5_3[63:63], v_skolemized_v_prenex_5_3[62:52], v_skolemized_v_prenex_5_3[51:0]))) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 50]: Loop Invariant [2019-11-20 07:02:31,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,872 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,873 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 63]: Loop Invariant [2019-11-20 07:02:31,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,874 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,875 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,876 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: (((((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && y == ~Pluszero~LONGDOUBLE()) && res == ~Pluszero~LONGDOUBLE()) && \result == ~Pluszero~LONGDOUBLE()) && aux-res == 0.0 && __signbit_double(res) == 0-aux) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 23]: Loop Invariant [2019-11-20 07:02:31,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,877 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,878 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-11-20 07:02:31,879 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] Derived loop invariant: ((((\exists v_skolemized_q#valueAsBitvector_7 : bv64 :: ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_7[63:63], v_skolemized_q#valueAsBitvector_7[62:52], v_skolemized_q#valueAsBitvector_7[51:0]) == ~Pluszero~LONGDOUBLE() && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 72]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && y == ~Pluszero~LONGDOUBLE()) && x == ~Pluszero~LONGDOUBLE() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 5.1s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 252 SDtfs, 332 SDslu, 546 SDs, 0 SdLazy, 173 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 257 GetRequests, 196 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 1.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, 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, 8 MinimizatonAttempts, 61 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 206 HoareAnnotationTreeSize, 8 FomulaSimplifications, 52 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 29 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 18200 SizeOfPredicates, 38 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 55 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...