./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ..................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c -s /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/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 4284cb37841cd94fe17da64cc250a8a1e69c6375 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 08:56:51,009 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:51,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:51,024 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:51,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:51,027 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:51,028 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:51,030 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:51,032 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:51,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:51,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:51,036 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:51,036 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:51,037 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:51,038 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:51,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:51,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:51,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:51,051 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:51,052 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:51,053 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:51,054 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:51,055 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:51,056 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:51,058 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:51,058 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:51,058 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:51,059 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:51,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:51,060 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:51,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:51,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:51,061 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:51,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:51,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:51,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:51,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:51,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:51,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:51,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:51,065 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:51,066 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:56:51,076 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:51,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:51,078 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:51,078 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:51,078 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:51,078 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:51,078 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:51,078 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:56:51,079 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:51,079 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:51,079 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:56:51,079 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:56:51,079 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:56:51,079 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:51,080 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:51,080 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:51,080 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:56:51,080 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:51,080 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:51,081 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:56:51,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:56:51,081 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:51,081 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:51,081 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:56:51,081 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:56:51,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:56:51,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:56:51,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:56:51,082 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-10-22 08:56:51,106 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:51,117 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:51,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:51,125 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:51,125 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:51,126 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-10-22 08:56:51,181 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/d471331a5/d8068a5929914fa2aa92935b45b109d0/FLAGc923f7071 [2019-10-22 08:56:51,547 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:51,548 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-10-22 08:56:51,555 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/d471331a5/d8068a5929914fa2aa92935b45b109d0/FLAGc923f7071 [2019-10-22 08:56:51,914 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/d471331a5/d8068a5929914fa2aa92935b45b109d0 [2019-10-22 08:56:51,917 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:51,918 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:51,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:51,919 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:51,923 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:51,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:51" (1/1) ... [2019-10-22 08:56:51,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23c146ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:51, skipping insertion in model container [2019-10-22 08:56:51,927 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:51" (1/1) ... [2019-10-22 08:56:51,934 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:51,950 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:52,116 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:52,121 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:52,213 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:52,232 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:52,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52 WrapperNode [2019-10-22 08:56:52,232 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:52,233 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:52,233 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:52,233 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:52,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,282 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:52,285 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:52,285 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:52,285 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:52,291 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,291 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,293 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,294 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,301 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,305 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... [2019-10-22 08:56:52,309 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:52,309 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:52,309 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:52,309 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:52,310 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-10-22 08:56:52,359 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:52,359 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 08:56:52,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:52,614 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:52,615 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-22 08:56:52,616 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52 BoogieIcfgContainer [2019-10-22 08:56:52,616 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:52,617 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:56:52,617 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:56:52,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:56:52,620 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:56:51" (1/3) ... [2019-10-22 08:56:52,627 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563e8694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:52, skipping insertion in model container [2019-10-22 08:56:52,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:52" (2/3) ... [2019-10-22 08:56:52,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@563e8694 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:52, skipping insertion in model container [2019-10-22 08:56:52,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52" (3/3) ... [2019-10-22 08:56:52,629 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-10-22 08:56:52,647 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:56:52,655 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:56:52,665 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:56:52,713 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:56:52,713 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:56:52,713 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:56:52,713 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:52,714 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:52,714 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:56:52,714 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:52,714 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:56:52,728 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-22 08:56:52,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:56:52,734 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:52,734 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:52,736 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:52,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,741 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-10-22 08:56:52,749 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,749 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330752216] [2019-10-22 08:56:52,749 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:52,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:52,848 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330752216] [2019-10-22 08:56:52,849 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:52,849 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 08:56:52,849 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448067404] [2019-10-22 08:56:52,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:56:52,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:52,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:56:52,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:56:52,864 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-22 08:56:52,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:52,879 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-10-22 08:56:52,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:56:52,881 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-22 08:56:52,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:52,891 INFO L225 Difference]: With dead ends: 62 [2019-10-22 08:56:52,891 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 08:56:52,894 INFO L600 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-10-22 08:56:52,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 08:56:52,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 08:56:52,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:56:52,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-10-22 08:56:52,926 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-10-22 08:56:52,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:52,927 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-10-22 08:56:52,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:56:52,927 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-10-22 08:56:52,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:56:52,928 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:52,928 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:52,928 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:52,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:52,928 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-10-22 08:56:52,929 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:52,929 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893281927] [2019-10-22 08:56:52,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,929 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:52,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:52,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:52,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:52,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893281927] [2019-10-22 08:56:52,998 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:52,998 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:52,998 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856674224] [2019-10-22 08:56:52,999 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:53,000 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:53,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:53,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:53,000 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2019-10-22 08:56:53,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:53,074 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2019-10-22 08:56:53,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:53,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-22 08:56:53,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:53,076 INFO L225 Difference]: With dead ends: 53 [2019-10-22 08:56:53,076 INFO L226 Difference]: Without dead ends: 44 [2019-10-22 08:56:53,077 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:53,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-10-22 08:56:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2019-10-22 08:56:53,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:56:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-22 08:56:53,082 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-10-22 08:56:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:53,082 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 08:56:53,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-22 08:56:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:56:53,083 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:53,083 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:53,084 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,084 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2019-10-22 08:56:53,084 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,084 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022777372] [2019-10-22 08:56:53,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,085 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:53,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:53,157 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022777372] [2019-10-22 08:56:53,158 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:53,158 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:56:53,158 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601473905] [2019-10-22 08:56:53,158 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:53,159 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:56:53,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:53,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:53,159 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2019-10-22 08:56:53,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:53,212 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2019-10-22 08:56:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:53,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 08:56:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:53,216 INFO L225 Difference]: With dead ends: 55 [2019-10-22 08:56:53,216 INFO L226 Difference]: Without dead ends: 46 [2019-10-22 08:56:53,217 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:56:53,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-22 08:56:53,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2019-10-22 08:56:53,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:56:53,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-22 08:56:53,223 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2019-10-22 08:56:53,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:53,223 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 08:56:53,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:53,223 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-22 08:56:53,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:56:53,224 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:53,224 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:53,224 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:53,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:53,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-10-22 08:56:53,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:56:53,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262756832] [2019-10-22 08:56:53,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:56:53,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:56:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:56:53,286 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:56:53,286 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:56:53,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:56:53 BoogieIcfgContainer [2019-10-22 08:56:53,308 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:56:53,309 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:56:53,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:56:53,309 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:56:53,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:52" (3/4) ... [2019-10-22 08:56:53,312 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 08:56:53,312 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:56:53,314 INFO L168 Benchmark]: Toolchain (without parser) took 1395.67 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 945.8 MB in the beginning and 1.0 GB in the end (delta: -80.1 MB). Peak memory consumption was 37.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:53,315 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:53,315 INFO L168 Benchmark]: CACSL2BoogieTranslator took 313.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:53,316 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:53,316 INFO L168 Benchmark]: Boogie Preprocessor took 23.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:53,317 INFO L168 Benchmark]: RCFGBuilder took 307.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:53,317 INFO L168 Benchmark]: TraceAbstraction took 691.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:56:53,318 INFO L168 Benchmark]: Witness Printer took 3.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:56:53,321 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 966.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 313.71 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 118.0 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -159.5 MB). Peak memory consumption was 20.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.55 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.85 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 307.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 691.36 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.2 MB). Peak memory consumption was 45.2 MB. Max. memory is 11.5 GB. * Witness Printer took 3.92 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 4, TraceHistogramMax: 1, AutomataDifference: 0.1s, 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.0s 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-cad4683 [2019-10-22 08:56:55,421 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:56:55,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:56:55,431 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:56:55,432 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:56:55,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:56:55,434 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:56:55,436 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:56:55,437 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:56:55,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:56:55,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:56:55,440 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:56:55,440 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:56:55,441 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:56:55,442 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:56:55,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:56:55,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:56:55,453 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:56:55,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:56:55,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:56:55,459 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:56:55,460 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:56:55,461 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:56:55,461 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:56:55,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:56:55,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:56:55,466 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:56:55,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:56:55,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:56:55,468 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:56:55,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:56:55,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:56:55,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:56:55,470 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:56:55,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:56:55,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:56:55,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:56:55,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:56:55,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:56:55,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:56:55,476 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:56:55,477 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-10-22 08:56:55,490 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:56:55,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:56:55,494 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:56:55,494 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:56:55,494 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:56:55,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:56:55,494 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:56:55,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:56:55,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:56:55,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:56:55,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:56:55,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:56:55,495 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-10-22 08:56:55,495 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-10-22 08:56:55,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:56:55,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:56:55,496 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:56:55,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:56:55,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:56:55,496 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:56:55,496 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:56:55,496 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:56:55,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:55,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:56:55,497 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:56:55,497 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:56:55,497 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-10-22 08:56:55,497 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-10-22 08:56:55,497 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:56:55,497 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-22 08:56:55,498 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2019-10-22 08:56:55,541 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:56:55,555 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:56:55,558 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:56:55,559 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:56:55,560 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:56:55,560 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-10-22 08:56:55,602 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/834459732/f0966812b38944018e3b8b96fd8ea674/FLAG70b74b63c [2019-10-22 08:56:55,972 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:56:55,973 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/sv-benchmarks/c/float-newlib/double_req_bl_1232a.c [2019-10-22 08:56:55,979 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/834459732/f0966812b38944018e3b8b96fd8ea674/FLAG70b74b63c [2019-10-22 08:56:56,360 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/data/834459732/f0966812b38944018e3b8b96fd8ea674 [2019-10-22 08:56:56,362 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:56:56,364 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:56:56,365 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:56,365 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:56:56,368 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:56:56,369 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,371 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad15412 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56, skipping insertion in model container [2019-10-22 08:56:56,372 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,378 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:56:56,391 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:56:56,535 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:56,542 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:56:56,577 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:56:56,620 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:56:56,620 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56 WrapperNode [2019-10-22 08:56:56,620 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:56:56,621 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:56,621 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:56:56,621 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:56:56,626 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,688 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:56:56,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:56:56,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:56:56,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:56:56,715 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,729 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... [2019-10-22 08:56:56,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:56:56,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:56:56,750 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:56:56,750 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:56:56,750 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:56:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-10-22 08:56:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:56:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-10-22 08:56:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:56:56,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:56:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:56:57,198 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:56:57,198 INFO L284 CfgBuilder]: Removed 18 assume(true) statements. [2019-10-22 08:56:57,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:57 BoogieIcfgContainer [2019-10-22 08:56:57,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:56:57,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:56:57,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:56:57,203 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:56:57,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:56:56" (1/3) ... [2019-10-22 08:56:57,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77458d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:57, skipping insertion in model container [2019-10-22 08:56:57,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:56:56" (2/3) ... [2019-10-22 08:56:57,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77458d32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:56:57, skipping insertion in model container [2019-10-22 08:56:57,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:57" (3/3) ... [2019-10-22 08:56:57,207 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a.c [2019-10-22 08:56:57,215 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:56:57,222 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 08:56:57,230 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 08:56:57,251 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:56:57,251 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:56:57,251 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:56:57,251 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:56:57,251 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:56:57,252 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:56:57,252 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:56:57,252 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:56:57,264 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2019-10-22 08:56:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-22 08:56:57,269 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:57,270 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:57,272 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:57,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,276 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2019-10-22 08:56:57,283 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:57,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1157620329] [2019-10-22 08:56:57,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-10-22 08:56:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,355 INFO L256 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 1 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:57,376 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:57,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:57,381 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1157620329] [2019-10-22 08:56:57,382 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:57,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-10-22 08:56:57,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262553992] [2019-10-22 08:56:57,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 08:56:57,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:57,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 08:56:57,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 08:56:57,402 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2019-10-22 08:56:57,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:57,425 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2019-10-22 08:56:57,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 08:56:57,426 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-22 08:56:57,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:57,436 INFO L225 Difference]: With dead ends: 62 [2019-10-22 08:56:57,437 INFO L226 Difference]: Without dead ends: 29 [2019-10-22 08:56:57,440 INFO L600 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-10-22 08:56:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-10-22 08:56:57,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-10-22 08:56:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-22 08:56:57,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2019-10-22 08:56:57,472 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2019-10-22 08:56:57,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:57,472 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2019-10-22 08:56:57,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 08:56:57,472 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2019-10-22 08:56:57,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-22 08:56:57,473 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:57,473 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:57,673 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-10-22 08:56:57,674 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:57,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:57,674 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2019-10-22 08:56:57,675 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:57,675 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1151425159] [2019-10-22 08:56:57,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-10-22 08:56:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:57,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:57,736 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:57,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:57,760 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:57,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:57,781 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1151425159] [2019-10-22 08:56:57,781 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:57,781 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:56:57,781 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064990113] [2019-10-22 08:56:57,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:57,783 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:57,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:57,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:57,784 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 6 states. [2019-10-22 08:56:58,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:58,012 INFO L93 Difference]: Finished difference Result 68 states and 85 transitions. [2019-10-22 08:56:58,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:58,015 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2019-10-22 08:56:58,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:58,016 INFO L225 Difference]: With dead ends: 68 [2019-10-22 08:56:58,016 INFO L226 Difference]: Without dead ends: 59 [2019-10-22 08:56:58,017 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:56:58,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2019-10-22 08:56:58,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 31. [2019-10-22 08:56:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-22 08:56:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2019-10-22 08:56:58,025 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2019-10-22 08:56:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:58,025 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-10-22 08:56:58,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:58,025 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2019-10-22 08:56:58,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 08:56:58,025 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:58,026 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:58,226 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-10-22 08:56:58,226 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:58,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2019-10-22 08:56:58,228 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:58,228 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1223319429] [2019-10-22 08:56:58,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-10-22 08:56:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:58,303 INFO L256 TraceCheckSpWp]: Trace formula consists of 47 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:56:58,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:58,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:58,353 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:58,387 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1223319429] [2019-10-22 08:56:58,387 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:58,387 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:56:58,387 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623110395] [2019-10-22 08:56:58,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:58,388 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:58,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:58,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:58,389 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 6 states. [2019-10-22 08:56:58,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:58,469 INFO L93 Difference]: Finished difference Result 52 states and 69 transitions. [2019-10-22 08:56:58,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:56:58,470 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2019-10-22 08:56:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:58,470 INFO L225 Difference]: With dead ends: 52 [2019-10-22 08:56:58,470 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 08:56:58,471 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:56:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 08:56:58,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-10-22 08:56:58,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-22 08:56:58,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2019-10-22 08:56:58,475 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 14 [2019-10-22 08:56:58,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:58,476 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-10-22 08:56:58,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:58,476 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2019-10-22 08:56:58,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-10-22 08:56:58,477 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:58,477 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:58,677 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-10-22 08:56:58,678 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:58,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:58,678 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2019-10-22 08:56:58,678 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:58,678 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1868359251] [2019-10-22 08:56:58,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-10-22 08:56:58,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:58,797 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 08:56:58,798 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:58,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:58,812 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:58,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:58,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1868359251] [2019-10-22 08:56:58,837 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:58,837 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 6 [2019-10-22 08:56:58,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526896607] [2019-10-22 08:56:58,838 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:56:58,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:58,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:56:58,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:56:58,838 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 6 states. [2019-10-22 08:56:58,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:58,907 INFO L93 Difference]: Finished difference Result 65 states and 76 transitions. [2019-10-22 08:56:58,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:56:58,908 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2019-10-22 08:56:58,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:58,909 INFO L225 Difference]: With dead ends: 65 [2019-10-22 08:56:58,909 INFO L226 Difference]: Without dead ends: 56 [2019-10-22 08:56:58,909 INFO L600 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-10-22 08:56:58,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-22 08:56:58,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-10-22 08:56:58,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:56:58,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-10-22 08:56:58,914 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2019-10-22 08:56:58,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:58,914 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-22 08:56:58,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:56:58,915 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2019-10-22 08:56:58,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:56:58,915 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:58,915 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:59,116 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-10-22 08:56:59,116 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:59,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:59,116 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2019-10-22 08:56:59,117 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:59,117 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1116700353] [2019-10-22 08:56:59,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-10-22 08:56:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:59,213 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 08:56:59,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:59,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:59,230 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:59,262 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:59,262 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1116700353] [2019-10-22 08:56:59,262 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:59,262 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-22 08:56:59,262 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283024996] [2019-10-22 08:56:59,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:56:59,263 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:59,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:56:59,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:56:59,264 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 4 states. [2019-10-22 08:56:59,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:59,284 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2019-10-22 08:56:59,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:56:59,285 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-22 08:56:59,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:59,286 INFO L225 Difference]: With dead ends: 40 [2019-10-22 08:56:59,286 INFO L226 Difference]: Without dead ends: 30 [2019-10-22 08:56:59,286 INFO L600 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-10-22 08:56:59,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-22 08:56:59,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-22 08:56:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 08:56:59,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2019-10-22 08:56:59,294 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 18 [2019-10-22 08:56:59,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:59,295 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-10-22 08:56:59,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:56:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2019-10-22 08:56:59,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-22 08:56:59,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:59,296 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:56:59,505 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-10-22 08:56:59,506 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:56:59,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:56:59,506 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2019-10-22 08:56:59,507 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:56:59,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [204161746] [2019-10-22 08:56:59,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-10-22 08:56:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:56:59,601 INFO L256 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2019-10-22 08:56:59,603 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:56:59,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:59,644 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:56:59,645 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:56:59,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:56:59,696 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [204161746] [2019-10-22 08:56:59,696 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:56:59,696 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-10-22 08:56:59,697 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113869679] [2019-10-22 08:56:59,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:56:59,697 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:56:59,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:56:59,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:56:59,698 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand 9 states. [2019-10-22 08:56:59,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:56:59,804 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2019-10-22 08:56:59,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:56:59,807 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 18 [2019-10-22 08:56:59,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:56:59,807 INFO L225 Difference]: With dead ends: 42 [2019-10-22 08:56:59,807 INFO L226 Difference]: Without dead ends: 39 [2019-10-22 08:56:59,808 INFO L600 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-10-22 08:56:59,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-10-22 08:56:59,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2019-10-22 08:56:59,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-22 08:56:59,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-22 08:56:59,816 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 18 [2019-10-22 08:56:59,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:56:59,816 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-22 08:56:59,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:56:59,817 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-22 08:56:59,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-22 08:56:59,817 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:56:59,817 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:00,018 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-10-22 08:57:00,018 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:00,018 INFO L82 PathProgramCache]: Analyzing trace with hash -208358251, now seen corresponding path program 1 times [2019-10-22 08:57:00,019 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:57:00,019 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855017653] [2019-10-22 08:57:00,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-10-22 08:57:00,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:00,099 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 08:57:00,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:00,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:00,137 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:57:00,155 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:00,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:00,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855017653] [2019-10-22 08:57:00,249 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:00,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-10-22 08:57:00,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159010563] [2019-10-22 08:57:00,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:57:00,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:57:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:57:00,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:57:00,250 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 8 states. [2019-10-22 08:57:00,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:00,363 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-22 08:57:00,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:00,365 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-10-22 08:57:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:00,365 INFO L225 Difference]: With dead ends: 45 [2019-10-22 08:57:00,365 INFO L226 Difference]: Without dead ends: 27 [2019-10-22 08:57:00,366 INFO L600 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-10-22 08:57:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-10-22 08:57:00,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-10-22 08:57:00,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-22 08:57:00,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-22 08:57:00,370 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 19 [2019-10-22 08:57:00,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:00,370 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-22 08:57:00,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:57:00,370 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-22 08:57:00,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-22 08:57:00,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:00,371 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:00,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-10-22 08:57:00,572 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:00,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:00,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2019-10-22 08:57:00,573 INFO L157 tionRefinementEngine]: Executing refinement strategy WOLF [2019-10-22 08:57:00,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [679364908] [2019-10-22 08:57:00,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-10-22 08:57:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:00,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-22 08:57:00,679 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 08:57:00,737 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:00,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:00,769 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-22 08:57:00,770 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 08:57:00,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:00,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [679364908] [2019-10-22 08:57:00,981 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:00,981 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10, 10] imperfect sequences [] total 16 [2019-10-22 08:57:00,981 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559318143] [2019-10-22 08:57:00,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-10-22 08:57:00,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-10-22 08:57:00,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-10-22 08:57:00,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2019-10-22 08:57:00,982 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 16 states. [2019-10-22 08:57:01,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:01,204 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-10-22 08:57:01,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:01,204 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 22 [2019-10-22 08:57:01,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:01,205 INFO L225 Difference]: With dead ends: 27 [2019-10-22 08:57:01,205 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 08:57:01,206 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2019-10-22 08:57:01,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 08:57:01,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 08:57:01,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 08:57:01,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 08:57:01,206 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-22 08:57:01,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:01,207 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 08:57:01,207 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-10-22 08:57:01,207 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 08:57:01,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 08:57:01,407 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-10-22 08:57:01,411 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 08:57:01,736 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 08:57:01,737 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 08:57:01,737 INFO L443 ceAbstractionStarter]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2019-10-22 08:57:01,737 INFO L439 ceAbstractionStarter]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-10-22 08:57:01,737 INFO L443 ceAbstractionStarter]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2019-10-22 08:57:01,737 INFO L443 ceAbstractionStarter]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2019-10-22 08:57:01,738 INFO L439 ceAbstractionStarter]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-10-22 08:57:01,738 INFO L443 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-10-22 08:57:01,738 INFO L443 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2019-10-22 08:57:01,738 INFO L443 ceAbstractionStarter]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2019-10-22 08:57:01,738 INFO L443 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2019-10-22 08:57:01,738 INFO L443 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2019-10-22 08:57:01,738 INFO L443 ceAbstractionStarter]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2019-10-22 08:57:01,739 INFO L439 ceAbstractionStarter]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (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|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= (bvadd |ULTIMATE.start___signbit_double_#res| (_ bv4294967295 32)) (_ bv0 32)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (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)) (= (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)) (fp.neg (_ +zero 11 53))))) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-10-22 08:57:01,739 INFO L443 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2019-10-22 08:57:01,739 INFO L443 ceAbstractionStarter]: For program point L31(lines 31 42) no Hoare annotation was computed. [2019-10-22 08:57:01,739 INFO L443 ceAbstractionStarter]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2019-10-22 08:57:01,739 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2019-10-22 08:57:01,739 INFO L443 ceAbstractionStarter]: For program point L48(lines 48 49) no Hoare annotation was computed. [2019-10-22 08:57:01,745 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 08:57:01,746 INFO L443 ceAbstractionStarter]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2019-10-22 08:57:01,746 INFO L439 ceAbstractionStarter]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (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|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) |ULTIMATE.start_main_#t~short11| (= ULTIMATE.start___signbit_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-10-22 08:57:01,746 INFO L443 ceAbstractionStarter]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2019-10-22 08:57:01,746 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 08:57:01,746 INFO L439 ceAbstractionStarter]: At program point L42(lines 18 43) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_2_3 (_ BitVec 64))) (and (= (_ +zero 11 53) (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))) (= ((_ extract 63 32) v_skolemized_v_prenex_2_3) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2019-10-22 08:57:01,746 INFO L439 ceAbstractionStarter]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (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|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (not (= (_ bv0 32) |ULTIMATE.start___fpclassify_double_#res|)) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-10-22 08:57:01,747 INFO L443 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2019-10-22 08:57:01,747 INFO L443 ceAbstractionStarter]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2019-10-22 08:57:01,747 INFO L446 ceAbstractionStarter]: At program point L84(lines 66 85) the Hoare annotation is: true [2019-10-22 08:57:01,747 INFO L443 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2019-10-22 08:57:01,747 INFO L443 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2019-10-22 08:57:01,747 INFO L439 ceAbstractionStarter]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (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|)) (fp.neg (_ +zero 11 53))) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_7|) ULTIMATE.start___fpclassify_double_~msw~0))) (= .cse0 |ULTIMATE.start_fmin_double_#res|) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= ULTIMATE.start_fmin_double_~y .cse0))) [2019-10-22 08:57:01,753 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,754 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,755 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,762 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,765 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,766 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,768 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,769 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,770 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,776 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,777 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,778 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,785 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,792 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,793 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,794 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:57:01 BoogieIcfgContainer [2019-10-22 08:57:01,796 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:57:01,796 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:57:01,796 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:57:01,796 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:57:01,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:56:57" (3/4) ... [2019-10-22 08:57:01,802 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 08:57:01,813 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2019-10-22 08:57:01,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2019-10-22 08:57:01,815 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-10-22 08:57:01,844 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_skolemized_v_prenex_2_3 : bv64 :: ~Pluszero~LONGDOUBLE() == ~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]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() [2019-10-22 08:57:01,844 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-10-22 08:57:01,845 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-10-22 08:57:01,845 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-10-22 08:57:01,845 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) [2019-10-22 08:57:01,876 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_72a20c43-7a0a-4f7f-8db3-ef3314ae6e7e/bin/uautomizer/witness.graphml [2019-10-22 08:57:01,877 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:57:01,879 INFO L168 Benchmark]: Toolchain (without parser) took 5514.56 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 218.6 MB). Free memory was 945.6 MB in the beginning and 1.2 GB in the end (delta: -239.4 MB). There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:01,879 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:57:01,879 INFO L168 Benchmark]: CACSL2BoogieTranslator took 255.91 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 929.5 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:01,880 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 929.5 MB in the beginning and 1.2 GB in the end (delta: -228.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:01,880 INFO L168 Benchmark]: Boogie Preprocessor took 35.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:01,881 INFO L168 Benchmark]: RCFGBuilder took 455.39 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: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:01,881 INFO L168 Benchmark]: TraceAbstraction took 4595.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.7 MB). Peak memory consumption was 282.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:01,881 INFO L168 Benchmark]: Witness Printer took 80.55 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.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:57:01,884 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 972.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 255.91 ms. Allocated memory is still 1.0 GB. Free memory was 945.6 MB in the beginning and 929.5 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 87.66 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 162.0 MB). Free memory was 929.5 MB in the beginning and 1.2 GB in the end (delta: -228.3 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 455.39 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: 30.2 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4595.41 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -70.7 MB). Peak memory consumption was 282.9 MB. Max. memory is 11.5 GB. * Witness Printer took 80.55 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.9 MB). Peak memory consumption was 6.9 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_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_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_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: 80]: 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: 54]: Loop Invariant [2019-10-22 08:57:01,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,892 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,893 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,894 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_5_3,QUANTIFIED] [2019-10-22 08:57:01,894 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~bvadd64(\result, 4294967295bv32) == 0bv32) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_skolemized_v_prenex_5_3 : bv64 :: msw == v_skolemized_v_prenex_5_3[63:32] && ~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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 18]: Loop Invariant [2019-10-22 08:57:01,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,896 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_v_prenex_2_3,QUANTIFIED] [2019-10-22 08:57:01,897 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 :: ~Pluszero~LONGDOUBLE() == ~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]) && v_skolemized_v_prenex_2_3[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 45]: Loop Invariant [2019-10-22 08:57:01,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,897 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,898 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,899 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 57]: Loop Invariant [2019-10-22 08:57:01,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,899 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,900 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,901 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == \result) && ~Pluszero~LONGDOUBLE() == x) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && aux-res == -0.0 && __signbit_double(res) == 1-aux) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2019-10-22 08:57:01,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,901 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,902 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_7,QUANTIFIED] [2019-10-22 08:57:01,903 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]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && v_skolemized_q#valueAsBitvector_7[63:32] == msw) && ~Pluszero~LONGDOUBLE() == x) && !(0bv32 == \result)) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. Result: SAFE, OverallTime: 4.4s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.9s, 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, 0.8s 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, 222 HoareAnnotationTreeSize, 8 FomulaSimplifications, 54 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 27 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 128 NumberOfCodeBlocks, 128 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 240 ConstructedInterpolants, 32 QuantifiedInterpolants, 21300 SizeOfPredicates, 38 NumberOfNonLiveVariables, 457 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...