./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0cd3be1d Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/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 97ac2503801a101f5a44ae44e4a77e81fa872959 ..................................................................................................................................................................................................................................................................................................................... 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_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/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 97ac2503801a101f5a44ae44e4a77e81fa872959 ............................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.23-0cd3be1 [2018-11-28 13:26:50,672 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:26:50,673 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:26:50,679 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:26:50,679 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:26:50,680 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:26:50,681 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:26:50,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:26:50,683 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:26:50,684 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:26:50,684 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:26:50,685 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:26:50,685 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:26:50,686 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:26:50,687 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:26:50,687 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:26:50,688 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:26:50,690 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:26:50,691 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:26:50,692 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:26:50,693 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:26:50,694 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:26:50,695 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:26:50,695 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:26:50,696 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:26:50,697 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:26:50,698 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:26:50,698 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:26:50,699 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:26:50,699 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:26:50,699 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:26:50,700 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:26:50,700 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:26:50,700 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:26:50,701 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:26:50,701 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:26:50,701 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-28 13:26:50,708 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:26:50,708 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:26:50,709 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:26:50,709 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:26:50,710 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:26:50,710 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:26:50,710 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:26:50,710 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:26:50,710 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:26:50,710 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-28 13:26:50,710 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:26:50,711 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:26:50,711 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:26:50,711 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:26:50,711 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:26:50,711 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:26:50,711 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:26:50,711 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:26:50,712 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:26:50,712 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:26:50,712 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:26:50,712 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:26:50,714 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:26:50,714 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:26:50,714 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:26:50,714 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:26:50,715 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:26:50,715 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-28 13:26:50,715 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:26:50,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-28 13:26:50,715 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_559f6e31-f010-481b-a523-76c071be1a23/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 -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-11-28 13:26:50,739 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:26:50,747 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:26:50,749 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:26:50,749 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:26:50,750 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:26:50,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-28 13:26:50,787 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/bfe8ad7c7/70364b82cd9540c8bfcf200c3407cc18/FLAG99ed378d5 [2018-11-28 13:26:51,083 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:26:51,083 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-28 13:26:51,087 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/bfe8ad7c7/70364b82cd9540c8bfcf200c3407cc18/FLAG99ed378d5 [2018-11-28 13:26:51,095 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/bfe8ad7c7/70364b82cd9540c8bfcf200c3407cc18 [2018-11-28 13:26:51,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:26:51,097 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:26:51,098 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:26:51,098 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:26:51,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:26:51,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,103 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3375cb2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51, skipping insertion in model container [2018-11-28 13:26:51,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,108 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:26:51,123 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:26:51,221 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:26:51,224 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:26:51,237 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:26:51,249 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:26:51,250 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51 WrapperNode [2018-11-28 13:26:51,250 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:26:51,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:26:51,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:26:51,250 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:26:51,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,265 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,305 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:26:51,305 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:26:51,305 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:26:51,305 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:26:51,311 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,311 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,312 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,312 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,317 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,319 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... [2018-11-28 13:26:51,320 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:26:51,320 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:26:51,321 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:26:51,321 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:26:51,321 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/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-28 13:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:26:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2018-11-28 13:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-28 13:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:26:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:26:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-11-28 13:26:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:26:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:26:51,361 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:26:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-28 13:26:51,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:26:51,501 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:26:51,502 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 13:26:51,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:26:51 BoogieIcfgContainer [2018-11-28 13:26:51,502 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:26:51,502 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:26:51,502 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:26:51,505 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:26:51,505 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:26:51" (1/3) ... [2018-11-28 13:26:51,506 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79626dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:26:51, skipping insertion in model container [2018-11-28 13:26:51,506 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:51" (2/3) ... [2018-11-28 13:26:51,507 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79626dc3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:26:51, skipping insertion in model container [2018-11-28 13:26:51,507 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:26:51" (3/3) ... [2018-11-28 13:26:51,508 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-28 13:26:51,517 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:26:51,523 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:26:51,538 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:26:51,563 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:26:51,564 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:26:51,564 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:26:51,564 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:26:51,565 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:26:51,565 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:26:51,565 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:26:51,565 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:26:51,565 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:26:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-28 13:26:51,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:26:51,587 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:26:51,588 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:51,590 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:26:51,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:51,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1326004698, now seen corresponding path program 1 times [2018-11-28 13:26:51,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:51,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:51,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:51,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:26:51,728 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-28 13:26:51,730 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:26:51,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:26:51,733 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:26:51,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:26:51,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:26:51,746 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-11-28 13:26:51,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:26:51,792 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-28 13:26:51,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:26:51,794 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-28 13:26:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:26:51,800 INFO L225 Difference]: With dead ends: 30 [2018-11-28 13:26:51,800 INFO L226 Difference]: Without dead ends: 16 [2018-11-28 13:26:51,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:26:51,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-28 13:26:51,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 13:26:51,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 13:26:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-28 13:26:51,823 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-28 13:26:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:26:51,824 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-28 13:26:51,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:26:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-28 13:26:51,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:26:51,824 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:26:51,825 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:51,825 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:26:51,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:51,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1310900661, now seen corresponding path program 1 times [2018-11-28 13:26:51,825 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-28 13:26:51,825 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-28 13:26:51,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:51,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:51,827 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-28 13:26:51,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:51,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-28 13:26:51,868 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-11-28 13:26:51,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 01:26:51 BoogieIcfgContainer [2018-11-28 13:26:51,889 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-28 13:26:51,889 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-28 13:26:51,889 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-28 13:26:51,889 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-28 13:26:51,890 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:26:51" (3/4) ... [2018-11-28 13:26:51,892 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-28 13:26:51,892 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-28 13:26:51,893 INFO L168 Benchmark]: Toolchain (without parser) took 795.96 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 952.2 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 17.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:51,894 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:51,895 INFO L168 Benchmark]: CACSL2BoogieTranslator took 151.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:51,895 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -216.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:51,896 INFO L168 Benchmark]: Boogie Preprocessor took 15.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:51,896 INFO L168 Benchmark]: RCFGBuilder took 181.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:51,897 INFO L168 Benchmark]: TraceAbstraction took 386.60 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: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. [2018-11-28 13:26:51,897 INFO L168 Benchmark]: Witness Printer took 3.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:26:51,899 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 151.87 ms. Allocated memory is still 1.0 GB. Free memory was 952.2 MB in the beginning and 941.4 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 165.7 MB). Free memory was 941.4 MB in the beginning and 1.2 GB in the end (delta: -216.6 MB). Peak memory consumption was 12.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 181.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 386.60 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: 39.8 MB). Peak memory consumption was 39.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.12 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 54]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 41, overapproximation of someBinaryArithmeticDOUBLEoperation at line 32. Possible FailurePath: [L1] int __return_main; [L12] float __return_72; [L13] int __return_87; VAL [\old(__return_72)=10, \old(__return_87)=7, \old(__return_main)=8, __return_72=0, __return_87=0, __return_main=0] [L16] float main__a; [L17] float main__r; [L18] main__a = __VERIFIER_nondet_float() [L19] int main____CPAchecker_TMP_0; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L20] COND TRUE main__a >= 0.10000000149011612 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main__a=16] [L22] COND TRUE main__a <= 100.0 [L24] main____CPAchecker_TMP_0 = 1 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=0, __return_87=0, __return_main=0, main____CPAchecker_TMP_0=1, main__a=16] [L25] COND TRUE main____CPAchecker_TMP_0 != 0 [L28] float __tmp_1; [L29] __tmp_1 = main__a [L30] float InvSqrt__x; [L31] InvSqrt__x = __tmp_1 [L32] float InvSqrt__xhalf = 0.5 * InvSqrt__x; [L33] union float_int InvSqrt__i; [L34] InvSqrt__i.f = InvSqrt__x [L35] EXPR InvSqrt__i.i [L35] InvSqrt__i.i = 1597463007 - ((InvSqrt__i.i) >> 1) [L36] EXPR InvSqrt__i.f [L36] InvSqrt__x = InvSqrt__i.f [L37] InvSqrt__x = InvSqrt__x * (1.5 - ((InvSqrt__xhalf * InvSqrt__x) * InvSqrt__x)) [L38] __return_72 = InvSqrt__x [L39] main__r = __return_72 [L40] int main____CPAchecker_TMP_1; VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L41] COND FALSE !(main__r >= 0.0) VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main__a=16, main__r=12] [L67] main____CPAchecker_TMP_1 = 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L48] int __tmp_2; [L49] __tmp_2 = main____CPAchecker_TMP_1 [L50] int __VERIFIER_assert__cond; [L51] __VERIFIER_assert__cond = __tmp_2 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L52] COND TRUE __VERIFIER_assert__cond == 0 VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] [L54] __VERIFIER_error() VAL [\old(__return_72)=0, \old(__return_87)=0, __return_72=12, __return_87=0, __return_main=0, __tmp_1=16, __tmp_2=0, __VERIFIER_assert__cond=0, InvSqrt__i={6:0}, InvSqrt__x=12, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__a=16, main__r=12] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 20 locations, 1 error locations. UNSAFE Result, 0.3s OverallTime, 2 OverallIterations, 1 TraceHistogramMax, 0.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 24 SDtfs, 5 SDslu, 43 SDs, 0 SdLazy, 8 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=20occurred 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 28 NumberOfCodeBlocks, 28 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 13 ConstructedInterpolants, 0 QuantifiedInterpolants, 221 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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-0cd3be1 [2018-11-28 13:26:53,337 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-28 13:26:53,338 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-28 13:26:53,347 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-28 13:26:53,347 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-28 13:26:53,347 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-28 13:26:53,348 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-28 13:26:53,349 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-28 13:26:53,350 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-28 13:26:53,351 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-28 13:26:53,351 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-28 13:26:53,351 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-28 13:26:53,353 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-28 13:26:53,353 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-28 13:26:53,354 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-28 13:26:53,354 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-28 13:26:53,355 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-28 13:26:53,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-28 13:26:53,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-28 13:26:53,359 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-28 13:26:53,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-28 13:26:53,361 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-28 13:26:53,362 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-28 13:26:53,362 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-28 13:26:53,363 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-28 13:26:53,363 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-28 13:26:53,364 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-28 13:26:53,364 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-28 13:26:53,365 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-28 13:26:53,366 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-28 13:26:53,366 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-28 13:26:53,366 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-28 13:26:53,366 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-28 13:26:53,367 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-28 13:26:53,368 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-28 13:26:53,368 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-28 13:26:53,368 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-11-28 13:26:53,379 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-28 13:26:53,379 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-28 13:26:53,380 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-28 13:26:53,380 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-28 13:26:53,380 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-28 13:26:53,380 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * Use SBE=true [2018-11-28 13:26:53,381 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-28 13:26:53,381 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-11-28 13:26:53,382 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-11-28 13:26:53,382 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-28 13:26:53,382 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-28 13:26:53,382 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-28 13:26:53,382 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-28 13:26:53,382 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-28 13:26:53,382 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-28 13:26:53,383 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-11-28 13:26:53,383 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-11-28 13:26:53,383 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_559f6e31-f010-481b-a523-76c071be1a23/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 -> 97ac2503801a101f5a44ae44e4a77e81fa872959 [2018-11-28 13:26:53,408 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-28 13:26:53,416 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-28 13:26:53,418 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-28 13:26:53,419 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-28 13:26:53,419 INFO L276 PluginConnector]: CDTParser initialized [2018-11-28 13:26:53,420 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/../../sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-28 13:26:53,455 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/7a8766e38/0f797772597647b4970730a874c2bafb/FLAG5bc0fb6a4 [2018-11-28 13:26:53,845 INFO L307 CDTParser]: Found 1 translation units. [2018-11-28 13:26:53,845 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/sv-benchmarks/c/float-benchs/inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-28 13:26:53,849 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/7a8766e38/0f797772597647b4970730a874c2bafb/FLAG5bc0fb6a4 [2018-11-28 13:26:53,857 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/bin-2019/uautomizer/data/7a8766e38/0f797772597647b4970730a874c2bafb [2018-11-28 13:26:53,859 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-28 13:26:53,860 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-28 13:26:53,861 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-28 13:26:53,861 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-28 13:26:53,863 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-28 13:26:53,863 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:26:53" (1/1) ... [2018-11-28 13:26:53,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@df9f055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:53, skipping insertion in model container [2018-11-28 13:26:53,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 01:26:53" (1/1) ... [2018-11-28 13:26:53,871 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-28 13:26:53,885 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-28 13:26:53,997 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:26:54,000 INFO L191 MainTranslator]: Completed pre-run [2018-11-28 13:26:54,015 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-28 13:26:54,035 INFO L195 MainTranslator]: Completed translation [2018-11-28 13:26:54,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54 WrapperNode [2018-11-28 13:26:54,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-28 13:26:54,036 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-28 13:26:54,036 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-28 13:26:54,036 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-28 13:26:54,042 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,048 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,052 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-28 13:26:54,052 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-28 13:26:54,052 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-28 13:26:54,053 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-28 13:26:54,058 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,058 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,069 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,073 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... [2018-11-28 13:26:54,075 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-28 13:26:54,076 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-28 13:26:54,076 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-28 13:26:54,076 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-28 13:26:54,077 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/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-28 13:26:54,161 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-28 13:26:54,162 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-28 13:26:54,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-28 13:26:54,162 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-28 13:26:54,162 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2018-11-28 13:26:56,568 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-11-28 13:26:56,719 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-28 13:26:56,719 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-11-28 13:26:56,720 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:26:56 BoogieIcfgContainer [2018-11-28 13:26:56,720 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-28 13:26:56,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-28 13:26:56,721 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-28 13:26:56,722 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-28 13:26:56,722 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 01:26:53" (1/3) ... [2018-11-28 13:26:56,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fe336e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:26:56, skipping insertion in model container [2018-11-28 13:26:56,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 01:26:54" (2/3) ... [2018-11-28 13:26:56,723 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27fe336e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 01:26:56, skipping insertion in model container [2018-11-28 13:26:56,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 01:26:56" (3/3) ... [2018-11-28 13:26:56,725 INFO L112 eAbstractionObserver]: Analyzing ICFG inv_sqrt_Quake_true-unreach-call.c.v+cfa-reducer.c [2018-11-28 13:26:56,730 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-28 13:26:56,735 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-28 13:26:56,744 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-28 13:26:56,760 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-28 13:26:56,760 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-28 13:26:56,761 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-28 13:26:56,761 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-28 13:26:56,761 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-28 13:26:56,761 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-28 13:26:56,761 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-28 13:26:56,761 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-28 13:26:56,761 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-28 13:26:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-11-28 13:26:56,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:26:56,774 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:26:56,774 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:56,775 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:26:56,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:56,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1326004698, now seen corresponding path program 1 times [2018-11-28 13:26:56,781 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 13:26:56,782 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/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-28 13:26:56,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:26:57,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:26:57,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:26:57,326 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-28 13:26:57,327 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:26:57,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:26:57,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-28 13:26:57,342 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-28 13:26:57,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-28 13:26:57,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-28 13:26:57,351 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 4 states. [2018-11-28 13:26:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:26:59,668 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2018-11-28 13:26:59,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-28 13:26:59,669 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-28 13:26:59,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:26:59,674 INFO L225 Difference]: With dead ends: 30 [2018-11-28 13:26:59,674 INFO L226 Difference]: Without dead ends: 16 [2018-11-28 13:26:59,676 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-28 13:26:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-28 13:26:59,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 13:26:59,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 13:26:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-28 13:26:59,696 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2018-11-28 13:26:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:26:59,696 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-28 13:26:59,697 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-28 13:26:59,697 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-28 13:26:59,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-28 13:26:59,697 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:26:59,697 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:26:59,698 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:26:59,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:26:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1310900661, now seen corresponding path program 1 times [2018-11-28 13:26:59,698 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 13:26:59,698 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/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-28 13:26:59,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:27:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:27:00,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:27:00,901 WARN L180 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2018-11-28 13:27:01,468 WARN L180 SmtUtils]: Spent 391.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 13:27:03,569 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from false [2018-11-28 13:27:05,656 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1)))))))))) is different from true [2018-11-28 13:27:11,946 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from false [2018-11-28 13:27:14,050 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (_ +zero 11 53)))))) is different from true [2018-11-28 13:27:26,666 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-28 13:27:26,667 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:27:26,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:27:26,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-28 13:27:26,681 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-28 13:27:26,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-28 13:27:26,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2018-11-28 13:27:26,682 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 6 states. [2018-11-28 13:27:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:27:28,989 INFO L93 Difference]: Finished difference Result 21 states and 20 transitions. [2018-11-28 13:27:29,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-28 13:27:29,080 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-11-28 13:27:29,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:27:29,081 INFO L225 Difference]: With dead ends: 21 [2018-11-28 13:27:29,081 INFO L226 Difference]: Without dead ends: 16 [2018-11-28 13:27:29,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=10, Invalid=6, Unknown=4, NotChecked=10, Total=30 [2018-11-28 13:27:29,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-28 13:27:29,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-28 13:27:29,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-28 13:27:29,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 15 transitions. [2018-11-28 13:27:29,084 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 15 transitions. Word has length 14 [2018-11-28 13:27:29,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:27:29,085 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 15 transitions. [2018-11-28 13:27:29,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-28 13:27:29,085 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 15 transitions. [2018-11-28 13:27:29,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-28 13:27:29,085 INFO L394 BasicCegarLoop]: Found error trace [2018-11-28 13:27:29,085 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-28 13:27:29,086 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-28 13:27:29,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-28 13:27:29,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1852104242, now seen corresponding path program 1 times [2018-11-28 13:27:29,086 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-11-28 13:27:29,086 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_559f6e31-f010-481b-a523-76c071be1a23/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-28 13:27:29,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-28 13:27:31,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-28 13:27:31,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-28 13:27:31,577 WARN L180 SmtUtils]: Spent 236.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-11-28 13:27:33,679 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from false [2018-11-28 13:27:35,778 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0))))) is different from true [2018-11-28 13:27:37,885 WARN L832 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) is different from false [2018-11-28 13:27:40,545 WARN L854 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven c_main_~main__r~0) (_ +zero 11 53)) (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (and (fp.geq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (= c_main_~main__r~0 ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse1 (let ((.cse2 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse1) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse0)) .cse1) .cse1))))))) (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)))))) is different from true [2018-11-28 13:27:46,886 WARN L832 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) is different from false [2018-11-28 13:27:48,989 WARN L854 $PredicateComparison]: unable to prove that (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) is different from true [2018-11-28 13:28:01,648 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-28 13:28:01,648 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-11-28 13:28:01,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-28 13:28:01,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-28 13:28:01,667 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-28 13:28:01,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-28 13:28:01,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2018-11-28 13:28:01,667 INFO L87 Difference]: Start difference. First operand 16 states and 15 transitions. Second operand 7 states. [2018-11-28 13:28:04,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-28 13:28:04,202 INFO L93 Difference]: Finished difference Result 16 states and 15 transitions. [2018-11-28 13:28:04,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-28 13:28:04,304 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-11-28 13:28:04,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-28 13:28:04,304 INFO L225 Difference]: With dead ends: 16 [2018-11-28 13:28:04,304 INFO L226 Difference]: Without dead ends: 0 [2018-11-28 13:28:04,305 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=12, Invalid=6, Unknown=6, NotChecked=18, Total=42 [2018-11-28 13:28:04,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-28 13:28:04,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-28 13:28:04,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-28 13:28:04,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-28 13:28:04,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 15 [2018-11-28 13:28:04,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-28 13:28:04,306 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-28 13:28:04,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-28 13:28:04,306 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-28 13:28:04,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-28 13:28:04,310 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-28 13:28:18,558 WARN L180 SmtUtils]: Spent 14.22 s on a formula simplification that was a NOOP. DAG size: 74 [2018-11-28 13:28:37,034 WARN L180 SmtUtils]: Spent 18.47 s on a formula simplification that was a NOOP. DAG size: 76 [2018-11-28 13:28:37,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:28:37,036 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:28:37,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:28:37,036 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-28 13:28:37,036 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-28 13:28:37,036 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-28 13:28:37,037 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-28 13:28:37,037 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 80) no Hoare annotation was computed. [2018-11-28 13:28:37,037 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 14 91) no Hoare annotation was computed. [2018-11-28 13:28:37,037 INFO L448 ceAbstractionStarter]: For program point L54(line 54) no Hoare annotation was computed. [2018-11-28 13:28:37,037 INFO L448 ceAbstractionStarter]: For program point L52(lines 52 61) no Hoare annotation was computed. [2018-11-28 13:28:37,037 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 14 91) no Hoare annotation was computed. [2018-11-28 13:28:37,037 INFO L444 ceAbstractionStarter]: At program point L73(lines 41 74) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse5) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse4)) .cse5) .cse5))))))) (_ +zero 11 53))))))) [2018-11-28 13:28:37,038 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 54) no Hoare annotation was computed. [2018-11-28 13:28:37,038 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 14 91) the Hoare annotation is: true [2018-11-28 13:28:37,038 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 85) no Hoare annotation was computed. [2018-11-28 13:28:37,038 INFO L448 ceAbstractionStarter]: For program point L20(lines 20 90) no Hoare annotation was computed. [2018-11-28 13:28:37,038 INFO L448 ceAbstractionStarter]: For program point L43(lines 43 69) no Hoare annotation was computed. [2018-11-28 13:28:37,038 INFO L448 ceAbstractionStarter]: For program point L41(lines 41 74) no Hoare annotation was computed. [2018-11-28 13:28:37,039 INFO L444 ceAbstractionStarter]: At program point L68(lines 43 69) the Hoare annotation is: (or (exists ((|v_q#valueAsBitvector_3| (_ BitVec 32))) (let ((.cse1 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_3|) ((_ extract 30 23) |v_q#valueAsBitvector_3|) ((_ extract 22 0) |v_q#valueAsBitvector_3|))))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse2 (let ((.cse3 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_3| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse3) ((_ extract 30 23) .cse3) ((_ extract 22 0) .cse3))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse2) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse1)) .cse2) .cse2))))))))) (and (fp.geq .cse0 (_ +zero 11 53)) (fp.geq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse1 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 10.0))))))) (exists ((|v_q#valueAsBitvector_2| (_ BitVec 32))) (let ((.cse4 ((_ to_fp 11 53) roundNearestTiesToEven (fp ((_ extract 31 31) |v_q#valueAsBitvector_2|) ((_ extract 30 23) |v_q#valueAsBitvector_2|) ((_ extract 22 0) |v_q#valueAsBitvector_2|))))) (and (fp.geq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven (/ 2500000037252903.0 25000000000000000.0))) (fp.leq .cse4 ((_ to_fp 11 53) roundNearestTiesToEven 100.0)) (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (let ((.cse5 (let ((.cse6 (bvadd (bvneg (bvashr |v_q#valueAsBitvector_2| (_ bv1 32))) (_ bv1597463007 32)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6))))) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven .cse5) (fp.sub roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 3.0 2.0)) ((_ to_fp 11 53) roundNearestTiesToEven (fp.mul roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 8 24) roundNearestTiesToEven (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (/ 1.0 2.0)) .cse4)) .cse5) .cse5))))))) (_ +zero 11 53)))))) (= (_ bv1 32) main_~main____CPAchecker_TMP_1~0)) [2018-11-28 13:28:37,047 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:105) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.InvariantResult.getLongDescription(InvariantResult.java:65) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:560) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:257) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:214) 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-28 13:28:37,049 INFO L168 Benchmark]: Toolchain (without parser) took 103189.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 944.7 MB in the beginning and 1.0 GB in the end (delta: -95.3 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:37,049 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:28:37,050 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.24 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:37,050 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.11 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:37,051 INFO L168 Benchmark]: Boogie Preprocessor took 23.17 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-28 13:28:37,051 INFO L168 Benchmark]: RCFGBuilder took 2644.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:37,052 INFO L168 Benchmark]: TraceAbstraction took 100327.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. [2018-11-28 13:28:37,054 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 972.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.24 ms. Allocated memory is still 1.0 GB. Free memory was 944.7 MB in the beginning and 934.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 16.11 ms. Allocated memory is still 1.0 GB. Free memory was 934.0 MB in the beginning and 928.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.17 ms. Allocated memory is still 1.0 GB. Free memory is still 928.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 2644.01 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 161.0 MB). Free memory was 928.6 MB in the beginning and 1.1 GB in the end (delta: -200.6 MB). Peak memory consumption was 14.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 100327.89 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 89.2 MB). Peak memory consumption was 89.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 54]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ExceptionOrErrorResult: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (bvneg (_ BitVec 32) (_ BitVec 32)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...