./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 13:29:24,754 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:29:24,755 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:29:24,761 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:29:24,761 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:29:24,762 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:29:24,763 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:29:24,764 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:29:24,765 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:29:24,766 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:29:24,766 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:29:24,767 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:29:24,767 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:29:24,768 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:29:24,769 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:29:24,769 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:29:24,770 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:29:24,771 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:29:24,772 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:29:24,773 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:29:24,774 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:29:24,775 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:29:24,776 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:29:24,777 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:29:24,777 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:29:24,778 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:29:24,778 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:29:24,779 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:29:24,779 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:29:24,780 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:29:24,780 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:29:24,780 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:29:24,780 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:29:24,780 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:29:24,781 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:29:24,781 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:29:24,782 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-23 13:29:24,788 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:29:24,789 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:29:24,789 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:29:24,789 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:29:24,790 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:29:24,790 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:29:24,790 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:29:24,790 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:29:24,790 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:29:24,790 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:29:24,790 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:29:24,790 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:29:24,791 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:29:24,791 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:29:24,791 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:29:24,791 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:29:24,791 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:29:24,791 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:29:24,791 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:29:24,791 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:29:24,792 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:29:24,792 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:29:24,793 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:29:24,793 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:24,816 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:29:24,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:29:24,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:29:24,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:29:24,829 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:29:24,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 13:29:24,876 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/2f9e02ca4/d2e740d18c7c41ef883783edba67632c/FLAG3f7a36fb5 [2018-11-23 13:29:25,179 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:29:25,180 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 13:29:25,184 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/2f9e02ca4/d2e740d18c7c41ef883783edba67632c/FLAG3f7a36fb5 [2018-11-23 13:29:25,196 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/2f9e02ca4/d2e740d18c7c41ef883783edba67632c [2018-11-23 13:29:25,199 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:29:25,200 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:29:25,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:29:25,201 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:29:25,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:29:25,204 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,207 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3585115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25, skipping insertion in model container [2018-11-23 13:29:25,207 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,214 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:29:25,232 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:29:25,361 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:29:25,363 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:29:25,379 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:29:25,391 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:29:25,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25 WrapperNode [2018-11-23 13:29:25,392 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:29:25,392 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:29:25,392 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:29:25,392 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:29:25,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,404 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,410 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:29:25,410 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:29:25,410 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:29:25,410 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:29:25,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,454 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,454 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,460 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,463 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,464 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... [2018-11-23 13:29:25,465 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:29:25,466 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:29:25,466 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:29:25,466 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:29:25,466 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:29:25,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:29:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:29:25,498 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:29:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 13:29:25,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 13:29:25,498 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:29:25,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:29:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-23 13:29:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:29:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:29:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:29:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 13:29:25,499 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 13:29:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:29:25,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:29:25,666 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:29:25,666 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:29:25,666 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:29:25 BoogieIcfgContainer [2018-11-23 13:29:25,666 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:29:25,667 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:29:25,667 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:29:25,670 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:29:25,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:29:25" (1/3) ... [2018-11-23 13:29:25,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42895c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:29:25, skipping insertion in model container [2018-11-23 13:29:25,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:25" (2/3) ... [2018-11-23 13:29:25,671 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42895c67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:29:25, skipping insertion in model container [2018-11-23 13:29:25,671 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:29:25" (3/3) ... [2018-11-23 13:29:25,673 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a_true-unreach-call.c [2018-11-23 13:29:25,681 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:29:25,687 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:29:25,701 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:29:25,724 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:29:25,725 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:29:25,725 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:29:25,725 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:29:25,725 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:29:25,725 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:29:25,725 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:29:25,725 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:29:25,725 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:29:25,737 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states. [2018-11-23 13:29:25,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:29:25,741 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:25,742 INFO L402 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] [2018-11-23 13:29:25,743 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:25,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:25,747 INFO L82 PathProgramCache]: Analyzing trace with hash 2125018936, now seen corresponding path program 1 times [2018-11-23 13:29:25,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:29:25,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:29:25,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:25,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:25,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:25,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:25,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:25,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:29:25,853 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:29:25,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:29:25,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:29:25,862 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 2 states. [2018-11-23 13:29:25,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:25,876 INFO L93 Difference]: Finished difference Result 79 states and 107 transitions. [2018-11-23 13:29:25,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:29:25,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 22 [2018-11-23 13:29:25,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:25,882 INFO L225 Difference]: With dead ends: 79 [2018-11-23 13:29:25,882 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 13:29:25,884 INFO L631 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 [2018-11-23 13:29:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 13:29:25,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-11-23 13:29:25,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 13:29:25,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-11-23 13:29:25,909 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 22 [2018-11-23 13:29:25,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:25,909 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-11-23 13:29:25,909 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:29:25,909 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2018-11-23 13:29:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:29:25,911 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:25,911 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:25,912 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:25,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash 2099930979, now seen corresponding path program 1 times [2018-11-23 13:29:25,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:29:25,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:29:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:25,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:25,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:25,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:25,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:25,979 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:25,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:25,980 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:25,981 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 4 states. [2018-11-23 13:29:26,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:26,014 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2018-11-23 13:29:26,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:26,015 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 13:29:26,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:26,017 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:29:26,017 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:29:26,017 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:29:26,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-11-23 13:29:26,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:29:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 13:29:26,023 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 23 [2018-11-23 13:29:26,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:26,023 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 13:29:26,024 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:26,024 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:29:26,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:29:26,024 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:26,024 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:26,024 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:26,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:26,025 INFO L82 PathProgramCache]: Analyzing trace with hash -2011933537, now seen corresponding path program 1 times [2018-11-23 13:29:26,025 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:29:26,025 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:29:26,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:26,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:26,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:26,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:26,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:26,080 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:26,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:26,081 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:26,081 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:26,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:26,082 INFO L87 Difference]: Start difference. First operand 44 states and 53 transitions. Second operand 4 states. [2018-11-23 13:29:26,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:26,103 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 13:29:26,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:26,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-11-23 13:29:26,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:26,104 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:29:26,104 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:29:26,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:26,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:29:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 44. [2018-11-23 13:29:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:29:26,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-23 13:29:26,108 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 53 transitions. Word has length 26 [2018-11-23 13:29:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:26,109 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-23 13:29:26,109 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 53 transitions. [2018-11-23 13:29:26,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-23 13:29:26,109 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:26,109 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:26,109 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:26,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:26,110 INFO L82 PathProgramCache]: Analyzing trace with hash 486082400, now seen corresponding path program 1 times [2018-11-23 13:29:26,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:29:26,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:29:26,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:26,110 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:26,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:29:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:29:26,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 13:29:26,154 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); VAL [|#NULL.base|=4293918726, |#NULL.offset|=4293918722, |old(#NULL.base)|=4293918726, |old(#NULL.offset)|=4293918722] [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918726, |old(#NULL.offset)|=4293918722] [?] assume true; VAL [|#NULL.base|=0, |#NULL.offset|=0, |old(#NULL.base)|=4293918726, |old(#NULL.offset)|=4293918722] [?] RET #90#return; VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret12 := main(); VAL [|#NULL.base|=0, |#NULL.offset|=0] [?] ~x~0 := 0.0;~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [main_~x~0=0.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [|#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=0.0, |fmin_double_#in~y|=4293918727.0] [?] ~x := #in~x;~y := #in~y; VAL [fmin_double_~x=0.0, fmin_double_~y=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=0.0, |fmin_double_#in~y|=4293918727.0] [?] CALL call #t~ret4 := __fpclassify_double(~x); VAL [|#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] ~x := #in~x;havoc ~msw~0;havoc ~lsw~0; VAL [__fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8);call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8);call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4);~msw~0 := #t~mem0;call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem0;havoc #t~union1;call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4);~lsw~0 := #t~mem2;call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8);havoc #t~mem2;havoc #t~union3;call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset);havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] goto; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0] [?] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296));#res := 0; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0, |__fpclassify_double_#res|=0] [?] assume true; VAL [__fpclassify_double_~lsw~0=1, __fpclassify_double_~msw~0=4293918721, __fpclassify_double_~x=0.0, |#NULL.base|=0, |#NULL.offset|=0, |__fpclassify_double_#in~x|=0.0, |__fpclassify_double_#res|=0] [?] RET #98#return; VAL [fmin_double_~x=0.0, fmin_double_~y=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=0.0, |fmin_double_#in~y|=4293918727.0, |fmin_double_#t~ret4|=0] [?] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [fmin_double_~x=0.0, fmin_double_~y=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=0.0, |fmin_double_#in~y|=4293918727.0, |fmin_double_#t~ret4|=0] [?] assume 0 == #t~ret4;havoc #t~ret4;#res := ~y; VAL [fmin_double_~x=0.0, fmin_double_~y=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=0.0, |fmin_double_#in~y|=4293918727.0, |fmin_double_#res|=4293918727.0] [?] assume true; VAL [fmin_double_~x=0.0, fmin_double_~y=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |fmin_double_#in~x|=0.0, |fmin_double_#in~y|=4293918727.0, |fmin_double_#res|=4293918727.0] [?] RET #94#return; VAL [main_~x~0=0.0, main_~y~0=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~ret9|=4293918727.0] [?] ~res~0 := #t~ret9;havoc #t~ret9;#t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [main_~res~0=4293918727.0, main_~x~0=0.0, main_~y~0=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11; VAL [main_~res~0=4293918727.0, main_~x~0=0.0, main_~y~0=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0, |main_#t~short11|=false] [?] assume !#t~short11;havoc #t~short11;havoc #t~ret10; VAL [main_~res~0=4293918727.0, main_~x~0=0.0, main_~y~0=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0] [?] assume !false; VAL [main_~res~0=4293918727.0, main_~x~0=0.0, main_~y~0=4293918727.0, |#NULL.base|=0, |#NULL.offset|=0] [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918726, #NULL.offset=4293918722, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~x=0.0, ~y=4.293918727E9] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L23] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L24] ~msw~0 := #t~mem0; [L24] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L25] ~lsw~0 := #t~mem2; [L25] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L28-L42] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L31-L42] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L34-L42] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L38-L42] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L42] #res := 0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L18-L43] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46-L47] assume 0 == #t~ret4; [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L45-L52] ensures true; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL.base=4293918726, #NULL.offset=4293918722, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] ensures true; VAL [#NULL.base=0, #NULL.offset=0, old(#NULL.base)=4293918726, old(#NULL.offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL.base=0, #NULL.offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL.base=0, #NULL.offset=0] [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL.base=0, #NULL.offset=0, ~x~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, ~x=0.0, ~y=4.293918727E9] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~x=0.0] [L22] call ~#ew_u~0.base, ~#ew_u~0.offset := #Ultimate.alloc(8); [L23] call write~real(~x, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] call #t~mem0 := read~int(~#ew_u~0.base, 4 + ~#ew_u~0.offset, 4); [L24] ~msw~0 := #t~mem0; [L24] call write~real(#t~union1, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] call #t~mem2 := read~int(~#ew_u~0.base, ~#ew_u~0.offset, 4); [L25] ~lsw~0 := #t~mem2; [L25] call write~real(#t~union3, ~#ew_u~0.base, ~#ew_u~0.offset, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] call ULTIMATE.dealloc(~#ew_u~0.base, ~#ew_u~0.offset); [L22] havoc ~#ew_u~0.base, ~#ew_u~0.offset; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L28-L42] assume !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L31-L42] assume !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L34-L42] assume !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)); VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L38-L42] assume !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)); [L42] #res := 0; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L18-L43] ensures true; VAL [#in~x=0.0, #NULL.base=0, #NULL.offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46-L47] assume 0 == #t~ret4; [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L45-L52] ensures true; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL.base=0, #NULL.offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL.base=0, #NULL.offset=0, #t~ret9=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] assume !#t~short11; VAL [#NULL.base=0, #NULL.offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79-L82] assume !#t~short11; [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L80] assert false; VAL [#NULL.base=0, #NULL.offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918727E9] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918727E9] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918727E9] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); VAL [#NULL!base=4293918726, #NULL!offset=4293918722, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; VAL [#NULL!base=0, #NULL!offset=0, old(#NULL!base)=4293918726, old(#NULL!offset)=4293918722] [?] RET call ULTIMATE.init(); VAL [#NULL!base=0, #NULL!offset=0] [?] CALL call #t~ret12 := main(); VAL [#NULL!base=0, #NULL!offset=0] [L74] ~x~0 := 0.0; [L75] ~y~0 := ~someUnaryDOUBLEoperation(0.0); VAL [#NULL!base=0, #NULL!offset=0, ~x~0=0.0] [L76] CALL call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0] [L45-L52] ~x := #in~x; [L45-L52] ~y := #in~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, ~x=0.0, ~y=4.293918727E9] [L46] CALL call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0] [L18-L43] ~x := #in~x; [L19] havoc ~msw~0; [L19] havoc ~lsw~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~x=0.0] [L22] FCALL call ~#ew_u~0 := #Ultimate.alloc(8); [L23] FCALL call write~real(~x, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] FCALL call #t~mem0 := read~int({ base: ~#ew_u~0!base, offset: 4 + ~#ew_u~0!offset }, 4); [L24] ~msw~0 := #t~mem0; [L24] FCALL call write~real(#t~union1, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L24] havoc #t~mem0; [L24] havoc #t~union1; [L25] FCALL call #t~mem2 := read~int({ base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 4); [L25] ~lsw~0 := #t~mem2; [L25] FCALL call write~real(#t~union3, { base: ~#ew_u~0!base, offset: ~#ew_u~0!offset }, 8); [L25] havoc #t~mem2; [L25] havoc #t~union3; [L22] FCALL call ULTIMATE.dealloc(~#ew_u~0); [L22] havoc ~#ew_u~0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L28-L29] COND FALSE !((0 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (2147483648 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L31-L32] COND FALSE !((~msw~0 % 4294967296 >= 1048576 && ~msw~0 % 4294967296 <= 2146435071) || (~msw~0 % 4294967296 >= 2148532224 && ~msw~0 % 4294967296 <= 4293918719)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L34-L35] COND FALSE !(~msw~0 % 4294967296 <= 1048575 || (~msw~0 % 4294967296 >= 2147483648 && ~msw~0 % 4294967296 <= 2148532223)) VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L38-L39] COND FALSE !((2146435072 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296) || (4293918720 == ~msw~0 % 4294967296 && 0 == ~lsw~0 % 4294967296)) [L42] #res := 0; VAL [#in~x=0.0, #NULL!base=0, #NULL!offset=0, #res=0, ~lsw~0=1, ~msw~0=4293918721, ~x=0.0] [L46] RET call #t~ret4 := __fpclassify_double(~x); VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #t~ret4=0, ~x=0.0, ~y=4.293918727E9] [L46] COND TRUE 0 == #t~ret4 [L46] havoc #t~ret4; [L47] #res := ~y; VAL [#in~x=0.0, #in~y=4.293918727E9, #NULL!base=0, #NULL!offset=0, #res=4.293918727E9, ~x=0.0, ~y=4.293918727E9] [L76] RET call #t~ret9 := fmin_double(~x~0, ~y~0); VAL [#NULL!base=0, #NULL!offset=0, #t~ret9=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L76] ~res~0 := #t~ret9; [L76] havoc #t~ret9; [L79] #t~short11 := ~someBinaryDOUBLEComparisonOperation(~res~0, ~someUnaryDOUBLEoperation(0.0)); VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND FALSE !(#t~short11) VAL [#NULL!base=0, #NULL!offset=0, #t~short11=false, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L79] COND TRUE !#t~short11 [L79] havoc #t~short11; [L79] havoc #t~ret10; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L80] assert false; VAL [#NULL!base=0, #NULL!offset=0, ~res~0=4.293918727E9, ~x~0=0.0, ~y~0=4.293918727E9] [L74] double x = 0.0; [L75] double y = -0.0; VAL [x=0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=0, \old(y)=4293918727] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [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)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; VAL [\old(x)=0, \result=0, lsw=1, msw=4293918721, x=0] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0, \old(y)=4293918727, __fpclassify_double(x)=0, x=0, y=4293918727] [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; VAL [\old(x)=0, \old(y)=4293918727, \result=4293918727, x=0, y=4293918727] [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4293918727, x=0, y=4293918727] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=4293918727, res == -0.0 && __signbit_double(res) == 1=0, x=0, y=4293918727] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=4293918727, x=0, y=4293918727] ----- [2018-11-23 13:29:26,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 01:29:26 BoogieIcfgContainer [2018-11-23 13:29:26,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 13:29:26,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 13:29:26,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 13:29:26,188 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 13:29:26,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:29:25" (3/4) ... [2018-11-23 13:29:26,190 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 13:29:26,190 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 13:29:26,191 INFO L168 Benchmark]: Toolchain (without parser) took 991.89 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 959.3 MB in the beginning and 1.1 GB in the end (delta: -98.4 MB). Peak memory consumption was 36.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:26,192 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:29:26,193 INFO L168 Benchmark]: CACSL2BoogieTranslator took 191.40 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:26,193 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:29:26,194 INFO L168 Benchmark]: Boogie Preprocessor took 55.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:26,194 INFO L168 Benchmark]: RCFGBuilder took 200.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:26,195 INFO L168 Benchmark]: TraceAbstraction took 519.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:26,195 INFO L168 Benchmark]: Witness Printer took 3.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:26,198 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 191.40 ms. Allocated memory is still 1.0 GB. Free memory was 959.3 MB in the beginning and 945.8 MB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 17.75 ms. Allocated memory is still 1.0 GB. Free memory is still 945.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 55.50 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.7 MB). Free memory was 945.8 MB in the beginning and 1.1 GB in the end (delta: -186.3 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 200.88 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 519.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.1 MB). Peak memory consumption was 52.1 MB. Max. memory is 11.5 GB. * Witness Printer took 3.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. 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; VAL [x=0] [L76] CALL, EXPR fmin_double(x, y) VAL [\old(x)=0, \old(y)=4293918727] [L46] CALL, EXPR __fpclassify_double(x) VAL [\old(x)=0] [L19] __uint32_t msw, lsw; VAL [\old(x)=0, x=0] [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)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) VAL [\old(x)=0, lsw=1, msw=4293918721, x=0] [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; VAL [\old(x)=0, \result=0, lsw=1, msw=4293918721, x=0] [L46] RET, EXPR __fpclassify_double(x) VAL [\old(x)=0, \old(y)=4293918727, __fpclassify_double(x)=0, x=0, y=4293918727] [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; VAL [\old(x)=0, \old(y)=4293918727, \result=4293918727, x=0, y=4293918727] [L76] RET, EXPR fmin_double(x, y) VAL [fmin_double(x, y)=4293918727, x=0, y=4293918727] [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 VAL [res=4293918727, res == -0.0 && __signbit_double(res) == 1=0, x=0, y=4293918727] [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() VAL [res=4293918727, x=0, y=4293918727] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 44 locations, 1 error locations. UNSAFE Result, 0.4s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 144 SDtfs, 0 SDslu, 172 SDs, 0 SdLazy, 17 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=44occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 4 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 97 NumberOfCodeBlocks, 97 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 68 ConstructedInterpolants, 0 QuantifiedInterpolants, 1926 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: 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.23-aa41828 [2018-11-23 13:29:27,659 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:29:27,660 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:29:27,669 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:29:27,669 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:29:27,670 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:29:27,670 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:29:27,671 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:29:27,672 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:29:27,673 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:29:27,674 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:29:27,674 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:29:27,674 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:29:27,675 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:29:27,676 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:29:27,676 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:29:27,677 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:29:27,678 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:29:27,679 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:29:27,680 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:29:27,681 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:29:27,681 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:29:27,683 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:29:27,683 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:29:27,683 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:29:27,684 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:29:27,685 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:29:27,685 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:29:27,686 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:29:27,686 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:29:27,686 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:29:27,687 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:29:27,687 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:29:27,687 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:29:27,688 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:29:27,688 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:29:27,688 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-23 13:29:27,698 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:29:27,698 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:29:27,699 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:29:27,699 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:29:27,700 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:29:27,700 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:29:27,700 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:29:27,700 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:29:27,700 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:29:27,700 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:29:27,700 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:29:27,701 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:29:27,702 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:29:27,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:29:27,702 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:29:27,702 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:29:27,702 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:29:27,702 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:29:27,702 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:29:27,703 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:29:27,703 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:29:27,703 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-23 13:29:27,703 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:29:27,703 INFO L133 SettingsManager]: * Command for external solver=cvc4nyu --tear-down-incremental --rewrite-divk --print-success --lang smt [2018-11-23 13:29:27,703 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-23 13:29:27,703 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:27,732 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:29:27,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:29:27,744 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:29:27,745 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:29:27,745 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:29:27,746 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/../../sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 13:29:27,783 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/e61562d21/a3a0b85fe9584b60b1eb487529a8b0e4/FLAG256957556 [2018-11-23 13:29:28,083 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:29:28,084 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/sv-benchmarks/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-11-23 13:29:28,088 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/e61562d21/a3a0b85fe9584b60b1eb487529a8b0e4/FLAG256957556 [2018-11-23 13:29:28,098 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/data/e61562d21/a3a0b85fe9584b60b1eb487529a8b0e4 [2018-11-23 13:29:28,100 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:29:28,102 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:29:28,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:29:28,103 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:29:28,105 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:29:28,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,108 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@567d81a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28, skipping insertion in model container [2018-11-23 13:29:28,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:29:28,133 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:29:28,269 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:29:28,273 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:29:28,295 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:29:28,313 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:29:28,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28 WrapperNode [2018-11-23 13:29:28,313 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:29:28,314 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:29:28,314 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:29:28,314 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:29:28,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,327 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,331 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:29:28,332 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:29:28,332 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:29:28,332 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:29:28,337 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,340 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,340 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,346 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,350 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,351 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... [2018-11-23 13:29:28,354 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:29:28,354 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:29:28,355 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:29:28,355 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:29:28,355 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:28,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-11-23 13:29:28,427 INFO L130 BoogieDeclarations]: Found specification of procedure __signbit_double [2018-11-23 13:29:28,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __signbit_double [2018-11-23 13:29:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:29:28,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:29:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure __fpclassify_double [2018-11-23 13:29:28,428 INFO L138 BoogieDeclarations]: Found implementation of procedure __fpclassify_double [2018-11-23 13:29:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:29:28,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:29:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:29:28,428 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-23 13:29:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:29:28,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:29:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure fmin_double [2018-11-23 13:29:28,429 INFO L138 BoogieDeclarations]: Found implementation of procedure fmin_double [2018-11-23 13:29:28,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:29:28,530 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:29:28,565 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-23 13:29:28,621 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:29:28,621 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 13:29:28,621 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:29:28 BoogieIcfgContainer [2018-11-23 13:29:28,621 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:29:28,622 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:29:28,622 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:29:28,625 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:29:28,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:29:28" (1/3) ... [2018-11-23 13:29:28,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e223475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:29:28, skipping insertion in model container [2018-11-23 13:29:28,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:29:28" (2/3) ... [2018-11-23 13:29:28,626 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e223475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:29:28, skipping insertion in model container [2018-11-23 13:29:28,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:29:28" (3/3) ... [2018-11-23 13:29:28,627 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a_true-unreach-call.c [2018-11-23 13:29:28,635 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:29:28,641 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:29:28,651 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:29:28,670 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:29:28,670 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:29:28,670 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:29:28,670 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:29:28,670 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:29:28,671 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:29:28,671 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:29:28,671 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:29:28,671 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:29:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2018-11-23 13:29:28,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 13:29:28,685 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:28,686 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:28,687 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:28,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:28,690 INFO L82 PathProgramCache]: Analyzing trace with hash -397395125, now seen corresponding path program 1 times [2018-11-23 13:29:28,693 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:28,693 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:28,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:28,747 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:28,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:28,763 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:28,775 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:28,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 13:29:28,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 13:29:28,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 13:29:28,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:29:28,787 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 2 states. [2018-11-23 13:29:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:28,803 INFO L93 Difference]: Finished difference Result 75 states and 103 transitions. [2018-11-23 13:29:28,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 13:29:28,804 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 21 [2018-11-23 13:29:28,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:28,810 INFO L225 Difference]: With dead ends: 75 [2018-11-23 13:29:28,811 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:29:28,813 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 13:29:28,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:29:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:29:28,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:29:28,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2018-11-23 13:29:28,841 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 21 [2018-11-23 13:29:28,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:28,841 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2018-11-23 13:29:28,841 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 13:29:28,841 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2018-11-23 13:29:28,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 13:29:28,843 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:28,843 INFO L402 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] [2018-11-23 13:29:28,843 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:28,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:28,846 INFO L82 PathProgramCache]: Analyzing trace with hash -2145002868, now seen corresponding path program 1 times [2018-11-23 13:29:28,847 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:28,847 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:28,856 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:28,905 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:28,928 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:28,935 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:28,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:28,936 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:28,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:28,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:28,937 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 4 states. [2018-11-23 13:29:28,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:28,965 INFO L93 Difference]: Finished difference Result 56 states and 66 transitions. [2018-11-23 13:29:28,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:28,970 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-11-23 13:29:28,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:28,973 INFO L225 Difference]: With dead ends: 56 [2018-11-23 13:29:28,973 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 13:29:28,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:28,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 13:29:28,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-11-23 13:29:28,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:29:28,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 13:29:28,982 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 22 [2018-11-23 13:29:28,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:28,983 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 13:29:28,983 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:28,983 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 13:29:28,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-11-23 13:29:28,984 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:28,984 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:28,984 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:28,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:28,985 INFO L82 PathProgramCache]: Analyzing trace with hash -1859452024, now seen corresponding path program 1 times [2018-11-23 13:29:28,985 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:28,985 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:28,992 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:29,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:29,041 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:29,056 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:29,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:29,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:29,063 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:29,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:29,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,064 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 13:29:29,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:29,112 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 13:29:29,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:29,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-11-23 13:29:29,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:29,113 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:29:29,113 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:29:29,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:29:29,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 13:29:29,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:29:29,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 13:29:29,117 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 23 [2018-11-23 13:29:29,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:29,117 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 13:29:29,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:29,118 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 13:29:29,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 13:29:29,118 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:29,118 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:29,118 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:29,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:29,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1911602824, now seen corresponding path program 1 times [2018-11-23 13:29:29,119 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:29,122 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:29,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:29,183 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:29,203 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:29,215 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:29,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:29,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:29,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:29,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,216 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 13:29:29,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:29,252 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 13:29:29,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:29,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-11-23 13:29:29,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:29,253 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:29:29,254 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:29:29,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:29:29,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 13:29:29,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:29:29,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 13:29:29,258 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 24 [2018-11-23 13:29:29,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:29,258 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 13:29:29,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:29,258 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 13:29:29,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:29:29,259 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:29,259 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:29,259 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:29,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:29,259 INFO L82 PathProgramCache]: Analyzing trace with hash 2064132100, now seen corresponding path program 1 times [2018-11-23 13:29:29,260 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:29,260 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:29,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:29,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:29,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:29,324 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:29,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:29,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:29,331 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:29,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:29,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,331 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 4 states. [2018-11-23 13:29:29,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:29,359 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2018-11-23 13:29:29,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:29,359 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 13:29:29,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:29,360 INFO L225 Difference]: With dead ends: 59 [2018-11-23 13:29:29,360 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 13:29:29,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 13:29:29,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-11-23 13:29:29,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:29:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2018-11-23 13:29:29,365 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 25 [2018-11-23 13:29:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:29,365 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2018-11-23 13:29:29,366 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:29,366 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2018-11-23 13:29:29,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:29:29,366 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:29,367 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:29,367 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:29,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:29,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1867618595, now seen corresponding path program 1 times [2018-11-23 13:29:29,367 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:29,367 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:29,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:29,424 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:29,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:29,478 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:29,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:29,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:29:29,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:29:29,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:29:29,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:29:29,486 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand 7 states. [2018-11-23 13:29:29,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:29,685 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2018-11-23 13:29:29,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:29:29,685 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-11-23 13:29:29,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:29,686 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:29:29,686 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:29:29,686 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:29:29,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:29:29,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-11-23 13:29:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:29:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 13:29:29,691 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 54 transitions. Word has length 25 [2018-11-23 13:29:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:29,692 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 13:29:29,692 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:29:29,692 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 54 transitions. [2018-11-23 13:29:29,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-11-23 13:29:29,692 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:29,693 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:29,693 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:29,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:29,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1438845801, now seen corresponding path program 1 times [2018-11-23 13:29:29,693 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:29,694 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:29,700 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:29,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:29,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:29:29,775 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:29,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:29,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:29,783 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:29,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:29,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,784 INFO L87 Difference]: Start difference. First operand 45 states and 54 transitions. Second operand 4 states. [2018-11-23 13:29:29,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:29,798 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2018-11-23 13:29:29,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:29,798 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 30 [2018-11-23 13:29:29,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:29,799 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:29:29,799 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:29:29,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:29:29,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 13:29:29,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:29:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 13:29:29,805 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 30 [2018-11-23 13:29:29,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:29,805 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 13:29:29,805 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:29,805 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 13:29:29,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-11-23 13:29:29,806 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:29,806 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:29,807 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:29,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:29,807 INFO L82 PathProgramCache]: Analyzing trace with hash 394703345, now seen corresponding path program 1 times [2018-11-23 13:29:29,807 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:29,807 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/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 [2018-11-23 13:29:29,810 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:29,869 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:29,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:29:29,893 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:29,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:29,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:29,901 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:29,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:29,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,901 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 13:29:29,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:29,916 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 13:29:29,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:29,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2018-11-23 13:29:29,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:29,917 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:29:29,917 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:29:29,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:29,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:29:29,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 13:29:29,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:29:29,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 13:29:29,923 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2018-11-23 13:29:29,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:29,923 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 13:29:29,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:29,923 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 13:29:29,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:29:29,924 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:29,924 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:29,924 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:29,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1599971557, now seen corresponding path program 1 times [2018-11-23 13:29:29,925 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:29,925 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:29,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:29,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:29,999 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:30,009 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:29:30,009 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:30,016 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:30,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:30,017 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:30,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:30,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:30,017 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 4 states. [2018-11-23 13:29:30,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:30,033 INFO L93 Difference]: Finished difference Result 66 states and 78 transitions. [2018-11-23 13:29:30,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:30,033 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2018-11-23 13:29:30,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:30,034 INFO L225 Difference]: With dead ends: 66 [2018-11-23 13:29:30,034 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 13:29:30,035 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:30,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 13:29:30,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2018-11-23 13:29:30,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:29:30,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2018-11-23 13:29:30,040 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 32 [2018-11-23 13:29:30,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:30,041 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2018-11-23 13:29:30,041 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2018-11-23 13:29:30,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:29:30,041 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:30,041 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:30,042 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:30,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:30,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1200719566, now seen corresponding path program 1 times [2018-11-23 13:29:30,044 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:30,044 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:30,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:30,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:30,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:30,183 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:29:30,183 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:30,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:30,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:29:30,190 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:29:30,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:29:30,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:29:30,191 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand 5 states. [2018-11-23 13:29:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:30,307 INFO L93 Difference]: Finished difference Result 64 states and 74 transitions. [2018-11-23 13:29:30,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:29:30,308 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-11-23 13:29:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:30,308 INFO L225 Difference]: With dead ends: 64 [2018-11-23 13:29:30,308 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:29:30,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:29:30,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:29:30,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-11-23 13:29:30,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:29:30,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 13:29:30,314 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 13:29:30,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:30,314 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 13:29:30,314 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:29:30,315 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 13:29:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 13:29:30,315 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:30,315 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:30,316 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:30,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:30,316 INFO L82 PathProgramCache]: Analyzing trace with hash 391372940, now seen corresponding path program 1 times [2018-11-23 13:29:30,316 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:30,316 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 12 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:30,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:30,373 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:30,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:29:30,446 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:30,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:30,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-11-23 13:29:30,453 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:29:30,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:29:30,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:29:30,454 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 8 states. [2018-11-23 13:29:30,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:30,773 INFO L93 Difference]: Finished difference Result 55 states and 64 transitions. [2018-11-23 13:29:30,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:29:30,773 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-23 13:29:30,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:30,774 INFO L225 Difference]: With dead ends: 55 [2018-11-23 13:29:30,774 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:29:30,774 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:29:30,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:29:30,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 48. [2018-11-23 13:29:30,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-11-23 13:29:30,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 57 transitions. [2018-11-23 13:29:30,779 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 57 transitions. Word has length 32 [2018-11-23 13:29:30,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:30,779 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 57 transitions. [2018-11-23 13:29:30,780 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:29:30,780 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 57 transitions. [2018-11-23 13:29:30,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:29:30,780 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:30,781 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:30,781 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:30,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:30,781 INFO L82 PathProgramCache]: Analyzing trace with hash -1382034430, now seen corresponding path program 1 times [2018-11-23 13:29:30,781 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:30,781 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 13 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:30,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:30,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:30,833 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:29:31,003 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:31,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:31,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-11-23 13:29:31,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 13:29:31,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 13:29:31,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-11-23 13:29:31,023 INFO L87 Difference]: Start difference. First operand 48 states and 57 transitions. Second operand 12 states. [2018-11-23 13:29:31,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:31,566 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-11-23 13:29:31,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 13:29:31,566 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 33 [2018-11-23 13:29:31,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:31,567 INFO L225 Difference]: With dead ends: 57 [2018-11-23 13:29:31,567 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:29:31,568 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2018-11-23 13:29:31,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:29:31,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-23 13:29:31,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:29:31,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 13:29:31,573 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 33 [2018-11-23 13:29:31,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:31,573 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 13:29:31,573 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 13:29:31,573 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 13:29:31,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:29:31,574 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:31,574 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:31,574 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:31,574 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:31,574 INFO L82 PathProgramCache]: Analyzing trace with hash -477473555, now seen corresponding path program 1 times [2018-11-23 13:29:31,575 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:31,575 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 14 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:31,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:31,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:31,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 13:29:31,643 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:31,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:31,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:29:31,651 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:29:31,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:29:31,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:31,651 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 4 states. [2018-11-23 13:29:31,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:31,662 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2018-11-23 13:29:31,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:29:31,663 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2018-11-23 13:29:31,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:31,664 INFO L225 Difference]: With dead ends: 63 [2018-11-23 13:29:31,664 INFO L226 Difference]: Without dead ends: 48 [2018-11-23 13:29:31,664 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:29:31,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-11-23 13:29:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2018-11-23 13:29:31,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 13:29:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 52 transitions. [2018-11-23 13:29:31,669 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 52 transitions. Word has length 33 [2018-11-23 13:29:31,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:31,669 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 52 transitions. [2018-11-23 13:29:31,669 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:29:31,669 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 52 transitions. [2018-11-23 13:29:31,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:29:31,670 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:31,670 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:31,670 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:31,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:31,670 INFO L82 PathProgramCache]: Analyzing trace with hash -673987060, now seen corresponding path program 1 times [2018-11-23 13:29:31,670 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:31,671 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 15 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:31,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:31,737 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:31,782 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:29:31,782 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:31,789 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:31,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 13:29:31,790 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 13:29:31,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 13:29:31,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-11-23 13:29:31,790 INFO L87 Difference]: Start difference. First operand 45 states and 52 transitions. Second operand 7 states. [2018-11-23 13:29:33,042 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-11-23 13:29:33,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:33,067 INFO L93 Difference]: Finished difference Result 48 states and 54 transitions. [2018-11-23 13:29:33,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 13:29:33,068 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2018-11-23 13:29:33,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:33,068 INFO L225 Difference]: With dead ends: 48 [2018-11-23 13:29:33,068 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 13:29:33,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-23 13:29:33,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 13:29:33,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-11-23 13:29:33,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 13:29:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 13:29:33,071 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 33 [2018-11-23 13:29:33,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:33,071 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 13:29:33,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 13:29:33,072 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 13:29:33,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-11-23 13:29:33,072 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:33,072 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:33,072 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:33,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:33,072 INFO L82 PathProgramCache]: Analyzing trace with hash -25386389, now seen corresponding path program 1 times [2018-11-23 13:29:33,073 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:33,073 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 16 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:33,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:33,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:33,139 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:33,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-23 13:29:33,331 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-23 13:29:33,343 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:29:33,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-11-23 13:29:33,343 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 13:29:33,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 13:29:33,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-11-23 13:29:33,344 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 13 states. [2018-11-23 13:29:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:29:34,026 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2018-11-23 13:29:34,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 13:29:34,027 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 40 [2018-11-23 13:29:34,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:29:34,027 INFO L225 Difference]: With dead ends: 50 [2018-11-23 13:29:34,027 INFO L226 Difference]: Without dead ends: 38 [2018-11-23 13:29:34,028 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2018-11-23 13:29:34,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-11-23 13:29:34,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2018-11-23 13:29:34,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 13:29:34,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2018-11-23 13:29:34,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 40 [2018-11-23 13:29:34,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:29:34,031 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2018-11-23 13:29:34,031 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 13:29:34,031 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2018-11-23 13:29:34,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-11-23 13:29:34,032 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:29:34,032 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:29:34,032 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:29:34,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:29:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 696190955, now seen corresponding path program 1 times [2018-11-23 13:29:34,033 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-23 13:29:34,033 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_e5327183-44ed-4a7c-98a9-ae844db4549e/bin-2019/uautomizer/mathsat Starting monitored process 17 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with mathsat -unsat_core_generation=3 [2018-11-23 13:29:34,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:29:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:29:34,171 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:29:34,206 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:29:34,207 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:29:34,208 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:29:34,208 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:29:34,209 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:29:34,209 INFO L683 Elim1Store]: detected equality via solver [2018-11-23 13:29:34,213 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 6 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 127 [2018-11-23 13:29:34,330 WARN L180 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 37 [2018-11-23 13:29:34,531 WARN L521 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 mathsat -unsat_core_generation=3 [2018-11-23 13:29:34,531 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:219) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacement(DerPreprocessor.java:210) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.convert(DerPreprocessor.java:142) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.cacheConvert(TermTransformer.java:131) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.access$0(TermTransformer.java:127) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer$Convert.walk(TermTransformer.java:79) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.logic.TermTransformer.transform(TermTransformer.java:253) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.Elim1Store.elim1(Elim1Store.java:211) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:221) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:225) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:247) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.ElimStorePlain.elimAllRec(ElimStorePlain.java:199) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:293) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:456) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-23 13:29:34,534 INFO L168 Benchmark]: Toolchain (without parser) took 6432.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 202.9 MB). Free memory was 949.2 MB in the beginning and 1.1 GB in the end (delta: -118.6 MB). Peak memory consumption was 84.3 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:34,534 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:29:34,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 211.43 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:34,535 INFO L168 Benchmark]: Boogie Procedure Inliner took 17.19 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:29:34,535 INFO L168 Benchmark]: Boogie Preprocessor took 22.58 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 13:29:34,535 INFO L168 Benchmark]: RCFGBuilder took 267.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:34,536 INFO L168 Benchmark]: TraceAbstraction took 5910.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. [2018-11-23 13:29:34,538 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 211.43 ms. Allocated memory is still 1.0 GB. Free memory was 949.2 MB in the beginning and 933.1 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 17.19 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.58 ms. Allocated memory is still 1.0 GB. Free memory is still 933.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 267.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 933.1 MB in the beginning and 1.1 GB in the end (delta: -167.3 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5910.84 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 71.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 32.6 MB). Peak memory consumption was 103.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: nested self-update not yet implemented: (store v_arrayElimCell_1 (_ bv0 32) ((_ extract 31 0) |v_q#valueAsBitvector_3|)): de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.DerPreprocessor.constructReplacementForStoreCase(DerPreprocessor.java:248) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...