./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 98b359d4210eaa0693e17be51fa07ce179f3b890 ..................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 98b359d4210eaa0693e17be51fa07ce179f3b890 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:45:25,445 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:45:25,447 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:45:25,465 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:45:25,465 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:45:25,467 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:45:25,469 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:45:25,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:45:25,483 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:45:25,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:45:25,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:45:25,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:45:25,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:45:25,493 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:45:25,494 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:45:25,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:45:25,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:45:25,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:45:25,501 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:45:25,504 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:45:25,508 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:45:25,512 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:45:25,513 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:45:25,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:45:25,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:45:25,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:45:25,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:45:25,521 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:45:25,521 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:45:25,522 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:45:25,522 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:45:25,523 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:45:25,524 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:45:25,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:45:25,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:45:25,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:45:25,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:45:25,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:45:25,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:45:25,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:45:25,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:45:25,531 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-27 23:45:25,560 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:45:25,560 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:45:25,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:45:25,562 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:45:25,564 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:45:25,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:45:25,565 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:45:25,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-27 23:45:25,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:45:25,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:45:25,566 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:45:25,567 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:45:25,567 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:45:25,567 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:45:25,567 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:45:25,568 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:45:25,568 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:45:25,568 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:45:25,568 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:45:25,569 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:45:25,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:45:25,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:25,570 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:45:25,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:45:25,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:45:25,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-27 23:45:25,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-27 23:45:25,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:45:25,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2019-11-27 23:45:25,876 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:45:25,890 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:45:25,893 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:45:25,894 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:45:25,894 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:45:25,895 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-27 23:45:25,954 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12fc87dd/6d27ddf744b3493e8b7d20017b22c41d/FLAG681f64909 [2019-11-27 23:45:26,407 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:45:26,407 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-27 23:45:26,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12fc87dd/6d27ddf744b3493e8b7d20017b22c41d/FLAG681f64909 [2019-11-27 23:45:26,820 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f12fc87dd/6d27ddf744b3493e8b7d20017b22c41d [2019-11-27 23:45:26,823 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:45:26,825 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:45:26,826 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:26,826 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:45:26,829 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:45:26,829 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:26" (1/1) ... [2019-11-27 23:45:26,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e1fa211 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:26, skipping insertion in model container [2019-11-27 23:45:26,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:26" (1/1) ... [2019-11-27 23:45:26,838 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:45:26,864 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:45:27,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:27,103 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:45:27,209 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:27,225 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:45:27,225 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27 WrapperNode [2019-11-27 23:45:27,225 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:27,226 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:27,226 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:45:27,226 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:45:27,233 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,246 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,288 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:27,290 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:45:27,290 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:45:27,290 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:45:27,297 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,298 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,303 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,321 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,338 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... [2019-11-27 23:45:27,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:45:27,342 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:45:27,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:45:27,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:45:27,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:45:27,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2019-11-27 23:45:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-27 23:45:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2019-11-27 23:45:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:45:27,404 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:45:27,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2019-11-27 23:45:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-27 23:45:27,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:45:27,955 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:45:27,955 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 23:45:27,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:27 BoogieIcfgContainer [2019-11-27 23:45:27,957 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:45:27,958 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:45:27,958 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:45:27,961 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:45:27,962 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:45:26" (1/3) ... [2019-11-27 23:45:27,962 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44771fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:27, skipping insertion in model container [2019-11-27 23:45:27,963 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:27" (2/3) ... [2019-11-27 23:45:27,963 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44771fa8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:27, skipping insertion in model container [2019-11-27 23:45:27,964 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:27" (3/3) ... [2019-11-27 23:45:27,965 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a.c [2019-11-27 23:45:27,975 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:45:27,982 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:45:27,994 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:45:28,013 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:45:28,014 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:45:28,014 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:45:28,014 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:45:28,014 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:45:28,014 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:45:28,015 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:45:28,015 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:45:28,027 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-27 23:45:28,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:45:28,034 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:28,035 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:28,035 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:28,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:28,040 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-27 23:45:28,047 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:28,047 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853498302] [2019-11-27 23:45:28,047 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:28,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:28,157 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:28,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853498302] [2019-11-27 23:45:28,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:28,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-27 23:45:28,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828913796] [2019-11-27 23:45:28,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:45:28,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:45:28,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:45:28,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:28,177 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-27 23:45:28,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:28,199 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-27 23:45:28,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:45:28,201 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-27 23:45:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:28,213 INFO L225 Difference]: With dead ends: 102 [2019-11-27 23:45:28,213 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 23:45:28,217 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 23:45:28,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-27 23:45:28,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-27 23:45:28,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-27 23:45:28,256 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-27 23:45:28,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:28,257 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-27 23:45:28,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:45:28,257 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-27 23:45:28,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:45:28,258 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:28,258 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:28,259 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:28,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:28,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-27 23:45:28,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:28,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227771171] [2019-11-27 23:45:28,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:28,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:28,414 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227771171] [2019-11-27 23:45:28,415 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:28,415 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-27 23:45:28,416 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689049928] [2019-11-27 23:45:28,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:45:28,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-27 23:45:28,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:45:28,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:28,419 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 3 states. [2019-11-27 23:45:28,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:28,437 INFO L93 Difference]: Finished difference Result 52 states and 57 transitions. [2019-11-27 23:45:28,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:45:28,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-27 23:45:28,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:28,440 INFO L225 Difference]: With dead ends: 52 [2019-11-27 23:45:28,440 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 23:45:28,441 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:28,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 23:45:28,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-27 23:45:28,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-27 23:45:28,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2019-11-27 23:45:28,448 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 18 [2019-11-27 23:45:28,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:28,449 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2019-11-27 23:45:28,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:45:28,449 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2019-11-27 23:45:28,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:45:28,450 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:28,451 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:28,451 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:28,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:28,452 INFO L82 PathProgramCache]: Analyzing trace with hash 581418946, now seen corresponding path program 1 times [2019-11-27 23:45:28,452 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-27 23:45:28,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850195203] [2019-11-27 23:45:28,453 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-27 23:45:28,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:45:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-27 23:45:28,660 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-27 23:45:28,660 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-27 23:45:28,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 11:45:28 BoogieIcfgContainer [2019-11-27 23:45:28,709 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-27 23:45:28,710 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-27 23:45:28,710 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-27 23:45:28,710 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-27 23:45:28,711 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:27" (3/4) ... [2019-11-27 23:45:28,714 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-27 23:45:28,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-27 23:45:28,717 INFO L168 Benchmark]: Toolchain (without parser) took 1891.14 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 961.7 MB in the beginning and 1.0 GB in the end (delta: -55.8 MB). Peak memory consumption was 60.0 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:28,717 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:28,718 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:28,719 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:28,720 INFO L168 Benchmark]: Boogie Preprocessor took 52.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:28,721 INFO L168 Benchmark]: RCFGBuilder took 614.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:28,722 INFO L168 Benchmark]: TraceAbstraction took 751.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:28,722 INFO L168 Benchmark]: Witness Printer took 4.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:28,726 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 400.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.9 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -143.7 MB). Peak memory consumption was 20.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 63.55 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 52.07 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 614.70 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 40.7 MB). Peak memory consumption was 40.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 751.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 40.4 MB). Peak memory consumption was 40.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.82 ms. Allocated memory is still 1.1 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 150]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of bitwiseOr at line 120, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144, overapproximation of bitwiseAnd at line 119, overapproximation of someBinaryDOUBLEComparisonOperation at line 149. Possible FailurePath: [L18] static const double one_modf = 1.0; VAL [one_modf=1] [L144] double x = 1.0 / 0.0; [L145] double iptr = __VERIFIER_nondet_double(); [L21] __int32_t i0, i1, j0; [L22] __uint32_t i; VAL [one_modf=1] [L24] ieee_double_shape_type ew_u; [L25] ew_u.value = (x) [L26] EXPR ew_u.parts.msw [L26] (i0) = ew_u.parts.msw [L27] EXPR ew_u.parts.lsw [L27] (i1) = ew_u.parts.lsw [L29] j0 = ((i0 >> 20) & 0x7ff) - 0x3ff VAL [one_modf=1] [L30] COND TRUE j0 < 20 VAL [one_modf=1] [L31] COND TRUE j0 < 0 VAL [one_modf=1] [L33] ieee_double_shape_type iw_u; [L34] iw_u.parts.msw = (i0 & 0x80000000) [L35] iw_u.parts.lsw = (0) [L36] EXPR iw_u.value [L36] (*iptr) = iw_u.value [L38] return x; VAL [one_modf=1] [L146] double res = modf_double(x, &iptr); [L149] EXPR \read(iptr) [L112] __int32_t hx, lx; VAL [one_modf=1] [L114] ieee_double_shape_type ew_u; [L115] ew_u.value = (x) [L116] EXPR ew_u.parts.msw [L116] (hx) = ew_u.parts.msw [L117] EXPR ew_u.parts.lsw [L117] (lx) = ew_u.parts.lsw [L119] hx &= 0x7fffffff [L120] hx |= (__uint32_t)(lx | (-lx)) >> 31 [L121] hx = 0x7ff00000 - hx [L122] return 1 - (int)((__uint32_t)(hx | (-hx)) >> 31); VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L149] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [one_modf=1] [L149] isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) VAL [one_modf=1] [L149] COND TRUE isinf_double(iptr) && !(res == 0.0 && __signbit_double(res) == 0) [L150] __VERIFIER_error() VAL [one_modf=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 52 locations, 1 error locations. Result: UNSAFE, OverallTime: 0.6s, OverallIterations: 3, TraceHistogramMax: 1, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 113 SDtfs, 0 SDslu, 49 SDs, 0 SdLazy, 5 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=52occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 53 NumberOfCodeBlocks, 53 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 31 ConstructedInterpolants, 0 QuantifiedInterpolants, 502 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-30f4e4a [2019-11-27 23:45:30,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-27 23:45:30,656 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-27 23:45:30,674 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-27 23:45:30,674 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-27 23:45:30,676 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-27 23:45:30,678 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-27 23:45:30,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-27 23:45:30,689 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-27 23:45:30,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-27 23:45:30,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-27 23:45:30,696 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-27 23:45:30,696 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-27 23:45:30,699 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-27 23:45:30,700 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-27 23:45:30,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-27 23:45:30,703 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-27 23:45:30,704 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-27 23:45:30,706 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-27 23:45:30,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-27 23:45:30,714 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-27 23:45:30,718 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-27 23:45:30,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-27 23:45:30,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-27 23:45:30,726 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-27 23:45:30,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-27 23:45:30,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-27 23:45:30,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-27 23:45:30,728 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-27 23:45:30,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-27 23:45:30,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-27 23:45:30,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-27 23:45:30,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-27 23:45:30,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-27 23:45:30,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-27 23:45:30,734 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-27 23:45:30,735 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-27 23:45:30,735 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-27 23:45:30,735 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-27 23:45:30,736 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-27 23:45:30,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-27 23:45:30,738 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2019-11-27 23:45:30,756 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-27 23:45:30,756 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-27 23:45:30,758 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-27 23:45:30,758 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-27 23:45:30,758 INFO L138 SettingsManager]: * Use SBE=true [2019-11-27 23:45:30,759 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-27 23:45:30,759 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-27 23:45:30,759 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-27 23:45:30,759 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-27 23:45:30,760 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-27 23:45:30,761 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-27 23:45:30,761 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-27 23:45:30,761 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-11-27 23:45:30,762 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-11-27 23:45:30,762 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-27 23:45:30,763 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-27 23:45:30,763 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-27 23:45:30,763 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-27 23:45:30,763 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-27 23:45:30,764 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-27 23:45:30,764 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-27 23:45:30,764 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-27 23:45:30,765 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:30,765 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-27 23:45:30,765 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-27 23:45:30,765 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-27 23:45:30,766 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2019-11-27 23:45:30,766 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-11-27 23:45:30,766 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-27 23:45:30,767 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-27 23:45:30,767 INFO L138 SettingsManager]: * Logic for external solver=AUFBV Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 98b359d4210eaa0693e17be51fa07ce179f3b890 [2019-11-27 23:45:31,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-27 23:45:31,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-27 23:45:31,088 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-27 23:45:31,090 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-27 23:45:31,090 INFO L275 PluginConnector]: CDTParser initialized [2019-11-27 23:45:31,091 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-27 23:45:31,153 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72678f7c/c31e021682fa405a94cf5f37dd658a47/FLAGedc2794f5 [2019-11-27 23:45:31,667 INFO L306 CDTParser]: Found 1 translation units. [2019-11-27 23:45:31,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_1211a.c [2019-11-27 23:45:31,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72678f7c/c31e021682fa405a94cf5f37dd658a47/FLAGedc2794f5 [2019-11-27 23:45:32,046 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c72678f7c/c31e021682fa405a94cf5f37dd658a47 [2019-11-27 23:45:32,049 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-27 23:45:32,051 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-27 23:45:32,052 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:32,052 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-27 23:45:32,055 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-27 23:45:32,056 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb99cf2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32, skipping insertion in model container [2019-11-27 23:45:32,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,066 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-27 23:45:32,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-27 23:45:32,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:32,410 INFO L203 MainTranslator]: Completed pre-run [2019-11-27 23:45:32,463 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-27 23:45:32,484 INFO L208 MainTranslator]: Completed translation [2019-11-27 23:45:32,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32 WrapperNode [2019-11-27 23:45:32,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-27 23:45:32,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:32,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-27 23:45:32,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-27 23:45:32,495 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,511 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,547 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-27 23:45:32,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-27 23:45:32,548 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-27 23:45:32,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-27 23:45:32,560 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,560 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,566 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,567 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,590 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,593 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... [2019-11-27 23:45:32,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-27 23:45:32,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-27 23:45:32,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-27 23:45:32,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-27 23:45:32,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-27 23:45:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2019-11-27 23:45:32,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2019-11-27 23:45:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-27 23:45:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8 [2019-11-27 23:45:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-11-27 23:45:32,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-27 23:45:32,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-27 23:45:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-11-27 23:45:32,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-27 23:45:33,768 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-27 23:45:33,769 INFO L297 CfgBuilder]: Removed 34 assume(true) statements. [2019-11-27 23:45:33,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:33 BoogieIcfgContainer [2019-11-27 23:45:33,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-27 23:45:33,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-27 23:45:33,771 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-27 23:45:33,774 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-27 23:45:33,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 11:45:32" (1/3) ... [2019-11-27 23:45:33,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7d4640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:33, skipping insertion in model container [2019-11-27 23:45:33,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 11:45:32" (2/3) ... [2019-11-27 23:45:33,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b7d4640 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 11:45:33, skipping insertion in model container [2019-11-27 23:45:33,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 11:45:33" (3/3) ... [2019-11-27 23:45:33,779 INFO L109 eAbstractionObserver]: Analyzing ICFG double_req_bl_1211a.c [2019-11-27 23:45:33,789 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-27 23:45:33,797 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-27 23:45:33,810 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-27 23:45:33,836 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-27 23:45:33,836 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-27 23:45:33,836 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-27 23:45:33,837 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-27 23:45:33,837 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-27 23:45:33,837 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-27 23:45:33,837 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-27 23:45:33,838 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-27 23:45:33,854 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2019-11-27 23:45:33,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-27 23:45:33,861 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:33,862 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:33,862 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:33,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:33,869 INFO L82 PathProgramCache]: Analyzing trace with hash -892017235, now seen corresponding path program 1 times [2019-11-27 23:45:33,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:33,882 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447031508] [2019-11-27 23:45:33,882 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:34,020 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 1 conjunts are in the unsatisfiable core [2019-11-27 23:45:34,025 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:34,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:34,040 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:34,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:34,048 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447031508] [2019-11-27 23:45:34,049 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:34,049 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-11-27 23:45:34,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244089675] [2019-11-27 23:45:34,055 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-27 23:45:34,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:34,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-27 23:45:34,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:34,072 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 2 states. [2019-11-27 23:45:34,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:34,095 INFO L93 Difference]: Finished difference Result 102 states and 164 transitions. [2019-11-27 23:45:34,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-27 23:45:34,097 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-11-27 23:45:34,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:34,107 INFO L225 Difference]: With dead ends: 102 [2019-11-27 23:45:34,107 INFO L226 Difference]: Without dead ends: 49 [2019-11-27 23:45:34,111 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-27 23:45:34,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-27 23:45:34,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2019-11-27 23:45:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-11-27 23:45:34,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 55 transitions. [2019-11-27 23:45:34,143 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 55 transitions. Word has length 15 [2019-11-27 23:45:34,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:34,143 INFO L462 AbstractCegarLoop]: Abstraction has 49 states and 55 transitions. [2019-11-27 23:45:34,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-27 23:45:34,144 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 55 transitions. [2019-11-27 23:45:34,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-27 23:45:34,144 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:34,145 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:34,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-11-27 23:45:34,346 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:34,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:34,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1752581688, now seen corresponding path program 1 times [2019-11-27 23:45:34,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:34,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [447440546] [2019-11-27 23:45:34,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:34,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:34,536 INFO L255 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-27 23:45:34,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:34,674 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:34,674 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:34,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:34,813 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [447440546] [2019-11-27 23:45:34,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:34,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [] total 8 [2019-11-27 23:45:34,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850365100] [2019-11-27 23:45:34,816 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-27 23:45:34,816 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:34,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-27 23:45:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-27 23:45:34,817 INFO L87 Difference]: Start difference. First operand 49 states and 55 transitions. Second operand 8 states. [2019-11-27 23:45:35,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:35,721 INFO L93 Difference]: Finished difference Result 64 states and 71 transitions. [2019-11-27 23:45:35,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:45:35,723 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2019-11-27 23:45:35,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:35,724 INFO L225 Difference]: With dead ends: 64 [2019-11-27 23:45:35,724 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:45:35,726 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-11-27 23:45:35,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:45:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:45:35,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:45:35,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-27 23:45:35,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2019-11-27 23:45:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:35,736 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-27 23:45:35,737 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-27 23:45:35,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-27 23:45:35,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-27 23:45:35,739 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:35,740 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:35,953 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-11-27 23:45:35,961 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:35,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:35,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1408426499, now seen corresponding path program 1 times [2019-11-27 23:45:35,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:35,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290148967] [2019-11-27 23:45:35,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:36,433 INFO L255 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-27 23:45:36,435 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:36,447 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:36,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:36,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290148967] [2019-11-27 23:45:36,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:36,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 3 [2019-11-27 23:45:36,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050001059] [2019-11-27 23:45:36,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-27 23:45:36,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:36,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-27 23:45:36,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:36,452 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 3 states. [2019-11-27 23:45:36,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:36,478 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-11-27 23:45:36,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-27 23:45:36,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-11-27 23:45:36,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:36,480 INFO L225 Difference]: With dead ends: 30 [2019-11-27 23:45:36,480 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:45:36,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-27 23:45:36,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:45:36,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:45:36,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:45:36,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2019-11-27 23:45:36,487 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2019-11-27 23:45:36,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:36,487 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2019-11-27 23:45:36,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-27 23:45:36,487 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2019-11-27 23:45:36,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-27 23:45:36,488 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:36,489 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:36,699 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-11-27 23:45:36,701 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:36,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:36,702 INFO L82 PathProgramCache]: Analyzing trace with hash -605570489, now seen corresponding path program 1 times [2019-11-27 23:45:36,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:36,704 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609511762] [2019-11-27 23:45:36,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:37,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:37,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-27 23:45:37,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:37,123 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 45 [2019-11-27 23:45:37,132 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:45:37,137 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:37,137 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:45:37,140 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:37,140 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:45:37,141 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:51, output treesize:21 [2019-11-27 23:45:37,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:37,214 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:37,215 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:37,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:37,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:37,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609511762] [2019-11-27 23:45:37,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:37,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [] total 9 [2019-11-27 23:45:37,287 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112200073] [2019-11-27 23:45:37,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-27 23:45:37,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:37,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-27 23:45:37,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-11-27 23:45:37,289 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 9 states. [2019-11-27 23:45:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:39,692 INFO L93 Difference]: Finished difference Result 31 states and 30 transitions. [2019-11-27 23:45:39,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-27 23:45:39,694 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-11-27 23:45:39,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:39,695 INFO L225 Difference]: With dead ends: 31 [2019-11-27 23:45:39,695 INFO L226 Difference]: Without dead ends: 27 [2019-11-27 23:45:39,696 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 3 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2019-11-27 23:45:39,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-11-27 23:45:39,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2019-11-27 23:45:39,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-27 23:45:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 26 transitions. [2019-11-27 23:45:39,702 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 26 transitions. Word has length 22 [2019-11-27 23:45:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:39,703 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 26 transitions. [2019-11-27 23:45:39,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-27 23:45:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 26 transitions. [2019-11-27 23:45:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-27 23:45:39,704 INFO L402 BasicCegarLoop]: Found error trace [2019-11-27 23:45:39,704 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-27 23:45:39,905 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-11-27 23:45:39,905 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-27 23:45:39,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-27 23:45:39,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1265561966, now seen corresponding path program 1 times [2019-11-27 23:45:39,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy WOLF [2019-11-27 23:45:39,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [884118271] [2019-11-27 23:45:39,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-11-27 23:45:40,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-27 23:45:40,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-27 23:45:40,336 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-27 23:45:40,415 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 48 [2019-11-27 23:45:40,424 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:45:40,427 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:40,427 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:45:40,443 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:40,444 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-11-27 23:45:40,444 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:69, output treesize:39 [2019-11-27 23:45:40,814 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:41,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:41,012 INFO L320 TraceCheckSpWp]: Computing backward predicates... [2019-11-27 23:45:41,014 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:41,015 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-27 23:45:41,479 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 52 [2019-11-27 23:45:41,483 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-27 23:45:41,486 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:41,487 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-27 23:45:41,493 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-27 23:45:41,494 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-27 23:45:41,494 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:65, output treesize:35 [2019-11-27 23:45:41,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-27 23:45:41,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [884118271] [2019-11-27 23:45:41,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-11-27 23:45:41,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12, 11] imperfect sequences [] total 18 [2019-11-27 23:45:41,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479711326] [2019-11-27 23:45:41,686 INFO L442 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-11-27 23:45:41,687 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2019-11-27 23:45:41,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-27 23:45:41,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=266, Unknown=0, NotChecked=0, Total=306 [2019-11-27 23:45:41,688 INFO L87 Difference]: Start difference. First operand 27 states and 26 transitions. Second operand 18 states. [2019-11-27 23:45:44,280 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2019-11-27 23:45:44,575 WARN L192 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2019-11-27 23:45:44,886 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 55 [2019-11-27 23:45:45,145 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-11-27 23:45:45,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-27 23:45:45,146 INFO L93 Difference]: Finished difference Result 27 states and 26 transitions. [2019-11-27 23:45:45,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-27 23:45:45,147 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 26 [2019-11-27 23:45:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-27 23:45:45,148 INFO L225 Difference]: With dead ends: 27 [2019-11-27 23:45:45,148 INFO L226 Difference]: Without dead ends: 0 [2019-11-27 23:45:45,149 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=170, Invalid=532, Unknown=0, NotChecked=0, Total=702 [2019-11-27 23:45:45,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-27 23:45:45,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-27 23:45:45,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-27 23:45:45,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-27 23:45:45,151 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2019-11-27 23:45:45,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-27 23:45:45,151 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-27 23:45:45,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-11-27 23:45:45,152 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-27 23:45:45,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-27 23:45:45,358 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-11-27 23:45:45,362 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-27 23:45:45,774 WARN L192 SmtUtils]: Spent 329.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-27 23:45:46,070 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2019-11-27 23:45:46,564 WARN L192 SmtUtils]: Spent 491.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2019-11-27 23:45:46,942 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2019-11-27 23:45:47,156 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 54 [2019-11-27 23:45:47,223 INFO L246 CegarLoopResult]: For program point L44-1(lines 44 48) no Hoare annotation was computed. [2019-11-27 23:45:47,223 INFO L242 CegarLoopResult]: At program point L44-2(lines 44 48) the Hoare annotation is: false [2019-11-27 23:45:47,223 INFO L246 CegarLoopResult]: For program point L69-1(lines 69 73) no Hoare annotation was computed. [2019-11-27 23:45:47,223 INFO L242 CegarLoopResult]: At program point L69-2(lines 69 73) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32)) (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32)))))) (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3))))) [2019-11-27 23:45:47,223 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-27 23:45:47,223 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-27 23:45:47,224 INFO L246 CegarLoopResult]: For program point L86-1(lines 86 90) no Hoare annotation was computed. [2019-11-27 23:45:47,224 INFO L242 CegarLoopResult]: At program point L86-2(lines 86 90) the Hoare annotation is: false [2019-11-27 23:45:47,224 INFO L246 CegarLoopResult]: For program point L128-1(lines 128 132) no Hoare annotation was computed. [2019-11-27 23:45:47,224 INFO L242 CegarLoopResult]: At program point L128-2(lines 128 132) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) ULTIMATE.start___signbit_double_~x) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-27 23:45:47,224 INFO L246 CegarLoopResult]: For program point L128-3(lines 128 132) no Hoare annotation was computed. [2019-11-27 23:45:47,224 INFO L246 CegarLoopResult]: For program point L30(lines 30 107) no Hoare annotation was computed. [2019-11-27 23:45:47,225 INFO L249 CegarLoopResult]: At program point L154(lines 137 155) the Hoare annotation is: true [2019-11-27 23:45:47,225 INFO L246 CegarLoopResult]: For program point L113-1(lines 113 118) no Hoare annotation was computed. [2019-11-27 23:45:47,225 INFO L242 CegarLoopResult]: At program point L113-2(lines 113 118) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-27 23:45:47,225 INFO L246 CegarLoopResult]: For program point L113-3(lines 113 118) no Hoare annotation was computed. [2019-11-27 23:45:47,225 INFO L242 CegarLoopResult]: At program point L105(lines 20 108) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-27 23:45:47,225 INFO L246 CegarLoopResult]: For program point L31(lines 31 65) no Hoare annotation was computed. [2019-11-27 23:45:47,226 INFO L242 CegarLoopResult]: At program point L122(lines 111 123) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-27 23:45:47,226 INFO L246 CegarLoopResult]: For program point L23-1(lines 23 28) no Hoare annotation was computed. [2019-11-27 23:45:47,227 INFO L242 CegarLoopResult]: At program point L23-2(lines 23 28) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53)) ULTIMATE.start_modf_double_~x)) [2019-11-27 23:45:47,227 INFO L246 CegarLoopResult]: For program point L23-3(lines 23 28) no Hoare annotation was computed. [2019-11-27 23:45:47,227 INFO L246 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-27 23:45:47,227 INFO L246 CegarLoopResult]: For program point L32-1(lines 32 37) no Hoare annotation was computed. [2019-11-27 23:45:47,227 INFO L242 CegarLoopResult]: At program point L32-2(lines 32 37) the Hoare annotation is: false [2019-11-27 23:45:47,228 INFO L246 CegarLoopResult]: For program point L32-3(lines 32 37) no Hoare annotation was computed. [2019-11-27 23:45:47,228 INFO L246 CegarLoopResult]: For program point L57-1(lines 57 62) no Hoare annotation was computed. [2019-11-27 23:45:47,228 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 150) no Hoare annotation was computed. [2019-11-27 23:45:47,232 INFO L242 CegarLoopResult]: At program point L57-2(lines 57 62) the Hoare annotation is: false [2019-11-27 23:45:47,232 INFO L246 CegarLoopResult]: For program point L57-3(lines 57 62) no Hoare annotation was computed. [2019-11-27 23:45:47,232 INFO L246 CegarLoopResult]: For program point L49(lines 49 54) no Hoare annotation was computed. [2019-11-27 23:45:47,232 INFO L246 CegarLoopResult]: For program point L49-1(lines 41 56) no Hoare annotation was computed. [2019-11-27 23:45:47,232 INFO L246 CegarLoopResult]: For program point L49-2(lines 49 54) no Hoare annotation was computed. [2019-11-27 23:45:47,232 INFO L246 CegarLoopResult]: For program point L74(lines 74 79) no Hoare annotation was computed. [2019-11-27 23:45:47,232 INFO L246 CegarLoopResult]: For program point L41(lines 41 64) no Hoare annotation was computed. [2019-11-27 23:45:47,232 INFO L246 CegarLoopResult]: For program point L74-1(lines 66 81) no Hoare annotation was computed. [2019-11-27 23:45:47,233 INFO L246 CegarLoopResult]: For program point L74-2(lines 74 79) no Hoare annotation was computed. [2019-11-27 23:45:47,233 INFO L246 CegarLoopResult]: For program point L66(lines 66 107) no Hoare annotation was computed. [2019-11-27 23:45:47,233 INFO L246 CegarLoopResult]: For program point L99-1(lines 99 104) no Hoare annotation was computed. [2019-11-27 23:45:47,233 INFO L242 CegarLoopResult]: At program point L99-2(lines 99 104) the Hoare annotation is: false [2019-11-27 23:45:47,233 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-27 23:45:47,233 INFO L246 CegarLoopResult]: For program point L99-3(lines 99 104) no Hoare annotation was computed. [2019-11-27 23:45:47,233 INFO L246 CegarLoopResult]: For program point L91(lines 91 96) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L91-1(lines 83 98) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L91-2(lines 91 96) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L149(line 149) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L149-1(line 149) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L83(lines 83 106) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L149-3(line 149) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L149-5(lines 149 152) no Hoare annotation was computed. [2019-11-27 23:45:47,234 INFO L246 CegarLoopResult]: For program point L150(line 150) no Hoare annotation was computed. [2019-11-27 23:45:47,235 INFO L242 CegarLoopResult]: At program point L134(lines 125 135) the Hoare annotation is: (and (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse0 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse0) ((_ extract 62 52) .cse0) ((_ extract 51 0) .cse0))) ULTIMATE.start_modf_double_~x))) (= |ULTIMATE.start___signbit_double_#res| (_ bv0 32)) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_main_~res~0 (let ((.cse1 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse1) ((_ extract 62 52) .cse1) ((_ extract 51 0) .cse1)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (let ((.cse2 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse2) ((_ extract 62 52) .cse2) ((_ extract 51 0) .cse2))) ULTIMATE.start___signbit_double_~x) (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (bvand (_ bv2047 32) (bvashr ((_ extract 63 32) v_skolemized_v_prenex_1_3) (_ bv20 32))) (bvadd ULTIMATE.start_modf_double_~j0~0 (_ bv1023 32))))) (exists ((v_skolemized_v_prenex_1_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_1_3) ((_ extract 62 52) v_skolemized_v_prenex_1_3) ((_ extract 51 0) v_skolemized_v_prenex_1_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start_modf_double_~i0~0 ((_ extract 63 32) v_skolemized_v_prenex_1_3)))) |ULTIMATE.start_main_#t~short32| (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (|v_skolemized_q#valueAsBitvector_27| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ULTIMATE.start___signbit_double_~msw~0 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_27|)) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_27|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_27|)) (let ((.cse3 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse3) ((_ extract 62 52) .cse3) ((_ extract 51 0) .cse3)))))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= (let ((.cse4 (concat (bvand (_ bv2147483648 32) ((_ extract 63 32) v_skolemized_v_prenex_7_3)) (_ bv0 32)))) (fp ((_ extract 63 63) .cse4) ((_ extract 62 52) .cse4) ((_ extract 51 0) .cse4))) |ULTIMATE.start_modf_double_#res|))) (exists ((v_skolemized_v_prenex_7_3 (_ BitVec 64)) (currentRoundingMode RoundingMode)) (and (= (fp ((_ extract 63 63) v_skolemized_v_prenex_7_3) ((_ extract 62 52) v_skolemized_v_prenex_7_3) ((_ extract 51 0) v_skolemized_v_prenex_7_3)) (fp.div currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1.0) (_ +zero 11 53))) (= ((_ extract 63 32) v_skolemized_v_prenex_7_3) ULTIMATE.start_modf_double_~high~1)))) [2019-11-27 23:45:47,241 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:446) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:135) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.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:106) 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:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createInvariantResults(TraceAbstractionStarter.java:258) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:215) 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:120) 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) [2019-11-27 23:45:47,255 INFO L168 Benchmark]: Toolchain (without parser) took 15196.23 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.0 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -158.2 MB). Peak memory consumption was 46.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:47,256 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:47,258 INFO L168 Benchmark]: CACSL2BoogieTranslator took 433.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:47,260 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:47,260 INFO L168 Benchmark]: Boogie Preprocessor took 51.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-27 23:45:47,261 INFO L168 Benchmark]: RCFGBuilder took 1171.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:47,262 INFO L168 Benchmark]: TraceAbstraction took 13474.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2019-11-27 23:45:47,270 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 433.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 144.7 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -182.5 MB). Peak memory consumption was 21.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.53 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.37 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1171.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 38.7 MB). Peak memory consumption was 38.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 13474.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 60.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -21.0 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 150]: 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 (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: translation of (concat (_ BitVec 32) (_ BitVec 32) (_ BitVec 64)) not yet implemented, please contact Matthias: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:209) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...