./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2e94e6aa Calling Ultimate with: 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.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 4284cb37841cd94fe17da64cc250a8a1e69c6375 ....................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: 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 /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.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 4284cb37841cd94fe17da64cc250a8a1e69c6375 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:37,912 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:37,913 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:37,937 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:37,938 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:37,939 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:37,940 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:37,942 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:37,944 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:37,945 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:37,946 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:37,946 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:37,947 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:37,948 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:37,949 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:37,950 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:37,951 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:37,955 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:37,957 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:37,962 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:37,963 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:37,967 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:37,973 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:37,973 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:37,975 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:37,976 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:37,977 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:37,978 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:37,978 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:37,979 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:37,980 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:37,980 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:37,980 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:37,981 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:37,982 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:37,982 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:37,982 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2018-12-31 03:58:37,998 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:37,998 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:37,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:37,999 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:38,000 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:38,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:38,000 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:38,000 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-31 03:58:38,000 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:38,001 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:38,001 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:38,001 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:38,001 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:38,001 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:38,002 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:38,002 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:38,002 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:38,002 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:38,002 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:38,003 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:38,003 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:38,003 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:38,003 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:38,003 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:38,004 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:38,004 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-31 03:58:38,004 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:38,004 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-31 03:58:38,004 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2018-12-31 03:58:38,066 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:38,084 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:38,091 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:38,093 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:38,093 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:38,095 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-12-31 03:58:38,156 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba0334c/43cdbb965bcc40eca63720ae72662e1e/FLAG3e6b1d2e9 [2018-12-31 03:58:38,594 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:38,595 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-12-31 03:58:38,603 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba0334c/43cdbb965bcc40eca63720ae72662e1e/FLAG3e6b1d2e9 [2018-12-31 03:58:38,951 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51ba0334c/43cdbb965bcc40eca63720ae72662e1e [2018-12-31 03:58:38,957 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:38,959 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:38,960 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:38,960 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:38,965 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:38,966 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da98c75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:38, skipping insertion in model container [2018-12-31 03:58:38,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:38" (1/1) ... [2018-12-31 03:58:38,979 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:39,006 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:39,291 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:39,298 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:39,352 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:39,382 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:39,383 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39 WrapperNode [2018-12-31 03:58:39,383 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:39,384 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:39,384 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:39,384 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:39,394 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,406 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,436 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:39,437 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:39,437 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:39,437 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:39,449 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,449 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,452 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,453 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,542 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,557 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,562 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (1/1) ... [2018-12-31 03:58:39,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:39,569 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:39,569 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:39,570 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:39,571 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (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 [2018-12-31 03:58:39,642 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2018-12-31 03:58:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:39,643 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-31 03:58:39,643 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:40,295 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:40,296 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-12-31 03:58:40,296 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:40 BoogieIcfgContainer [2018-12-31 03:58:40,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:40,297 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:40,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:40,301 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:40,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:38" (1/3) ... [2018-12-31 03:58:40,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21819a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:40, skipping insertion in model container [2018-12-31 03:58:40,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:39" (2/3) ... [2018-12-31 03:58:40,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21819a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:40, skipping insertion in model container [2018-12-31 03:58:40,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:40" (3/3) ... [2018-12-31 03:58:40,305 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a_true-unreach-call.c [2018-12-31 03:58:40,316 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:40,325 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:40,344 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:40,379 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:40,380 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:40,380 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:40,380 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:40,380 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:40,381 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:40,381 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:40,381 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:40,381 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-31 03:58:40,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:58:40,406 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:40,407 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:40,409 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:40,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:40,415 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2018-12-31 03:58:40,417 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:40,417 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:40,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:40,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:40,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:40,542 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:40,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:40,547 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:40,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:40,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:40,566 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-12-31 03:58:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:40,592 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2018-12-31 03:58:40,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:40,594 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:58:40,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:40,609 INFO L225 Difference]: With dead ends: 62 [2018-12-31 03:58:40,610 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 03:58:40,614 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 03:58:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-31 03:58:40,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 03:58:40,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-12-31 03:58:40,658 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2018-12-31 03:58:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:40,658 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-12-31 03:58:40,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:40,659 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-12-31 03:58:40,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:40,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:40,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:40,660 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:40,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:40,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2018-12-31 03:58:40,661 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:40,661 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,662 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:40,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:40,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:40,889 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:40,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:40,894 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:40,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:40,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:40,896 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2018-12-31 03:58:41,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:41,215 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-12-31 03:58:41,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:41,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 03:58:41,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:41,217 INFO L225 Difference]: With dead ends: 53 [2018-12-31 03:58:41,217 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 03:58:41,219 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:41,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 03:58:41,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-12-31 03:58:41,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 03:58:41,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-12-31 03:58:41,227 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2018-12-31 03:58:41,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:41,227 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-12-31 03:58:41,228 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:41,228 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2018-12-31 03:58:41,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:41,228 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:41,229 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:41,229 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:41,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:41,229 INFO L82 PathProgramCache]: Analyzing trace with hash -555760345, now seen corresponding path program 1 times [2018-12-31 03:58:41,229 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:41,229 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:41,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:41,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:41,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:41,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:41,309 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:41,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:41,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:41,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:41,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:41,312 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2018-12-31 03:58:41,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:41,557 INFO L93 Difference]: Finished difference Result 55 states and 69 transitions. [2018-12-31 03:58:41,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:41,558 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-31 03:58:41,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:41,560 INFO L225 Difference]: With dead ends: 55 [2018-12-31 03:58:41,560 INFO L226 Difference]: Without dead ends: 46 [2018-12-31 03:58:41,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:41,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-31 03:58:41,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2018-12-31 03:58:41,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 03:58:41,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-12-31 03:58:41,568 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 14 [2018-12-31 03:58:41,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:41,569 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-12-31 03:58:41,569 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2018-12-31 03:58:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-31 03:58:41,570 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:41,570 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:41,570 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:41,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:41,572 INFO L82 PathProgramCache]: Analyzing trace with hash 1219247017, now seen corresponding path program 1 times [2018-12-31 03:58:41,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-31 03:58:41,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-31 03:58:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:41,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:41,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-31 03:58:41,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:41,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-31 03:58:41,660 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2018-12-31 03:58:41,690 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:41 BoogieIcfgContainer [2018-12-31 03:58:41,690 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:41,690 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:41,690 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:41,691 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:41,691 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:40" (3/4) ... [2018-12-31 03:58:41,695 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-31 03:58:41,695 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:41,696 INFO L168 Benchmark]: Toolchain (without parser) took 2738.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -103.2 MB). Peak memory consumption was 32.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:41,698 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:41,698 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:41,699 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.81 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:41,700 INFO L168 Benchmark]: Boogie Preprocessor took 132.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:41,701 INFO L168 Benchmark]: RCFGBuilder took 727.38 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:41,702 INFO L168 Benchmark]: TraceAbstraction took 1392.34 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:41,703 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:41,708 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.17 ms. Allocated memory is still 1.0 GB. Free memory was 952.7 MB in the beginning and 942.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.81 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 936.6 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 132.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 936.6 MB in the beginning and 1.1 GB in the end (delta: -185.3 MB). Peak memory consumption was 13.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 727.38 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: 18.8 MB). Peak memory consumption was 18.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1392.34 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: 47.1 MB). Peak memory consumption was 47.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 80]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 79, overapproximation of someUnaryDOUBLEoperation at line 75. Possible FailurePath: [L74] double x = 0.0; [L75] double y = -0.0; [L19] __uint32_t msw, lsw; [L22] ieee_double_shape_type ew_u; [L23] ew_u.value = (x) [L24] EXPR ew_u.parts.msw [L24] (msw) = ew_u.parts.msw [L25] EXPR ew_u.parts.lsw [L25] (lsw) = ew_u.parts.lsw [L28-L29] COND FALSE !((msw == 0x00000000 && lsw == 0x00000000) || (msw == 0x80000000 && lsw == 0x00000000)) [L31-L32] COND FALSE !((msw >= 0x00100000 && msw <= 0x7fefffff) || (msw >= 0x80100000 && msw <= 0xffefffff)) [L34-L35] COND FALSE !(( msw <= 0x000fffff) || (msw >= 0x80000000 && msw <= 0x800fffff)) [L38-L39] COND FALSE !((msw == 0x7ff00000 && lsw == 0x00000000) || (msw == 0xfff00000 && lsw == 0x00000000)) [L42] return 0; [L46] COND TRUE __fpclassify_double(x) == 0 [L47] return y; [L76] double res = fmin_double(x, y); [L79] EXPR res == -0.0 && __signbit_double(res) == 1 [L79] COND TRUE !(res == -0.0 && __signbit_double(res) == 1) [L80] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. UNSAFE Result, 1.3s OverallTime, 4 OverallIterations, 1 TraceHistogramMax, 0.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 135 SDtfs, 32 SDslu, 140 SDs, 0 SdLazy, 30 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 28 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 49 NumberOfCodeBlocks, 49 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 32 ConstructedInterpolants, 0 QuantifiedInterpolants, 442 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.24-2e94e6a [2018-12-31 03:58:44,194 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-31 03:58:44,196 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-31 03:58:44,212 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-31 03:58:44,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-31 03:58:44,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-31 03:58:44,217 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-31 03:58:44,220 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-31 03:58:44,228 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-31 03:58:44,230 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-31 03:58:44,232 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-31 03:58:44,233 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-31 03:58:44,234 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-31 03:58:44,237 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-31 03:58:44,240 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-31 03:58:44,242 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-31 03:58:44,242 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-31 03:58:44,247 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-31 03:58:44,251 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-31 03:58:44,253 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-31 03:58:44,255 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-31 03:58:44,256 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-31 03:58:44,260 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-31 03:58:44,262 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-31 03:58:44,262 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-31 03:58:44,263 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-31 03:58:44,263 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-31 03:58:44,266 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-31 03:58:44,268 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-31 03:58:44,270 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-31 03:58:44,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-31 03:58:44,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-31 03:58:44,273 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-31 03:58:44,273 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-31 03:58:44,276 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-31 03:58:44,277 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-31 03:58:44,277 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2018-12-31 03:58:44,306 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-31 03:58:44,307 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-31 03:58:44,308 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-31 03:58:44,309 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-31 03:58:44,309 INFO L133 SettingsManager]: * Use SBE=true [2018-12-31 03:58:44,310 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-31 03:58:44,310 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-31 03:58:44,311 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-31 03:58:44,311 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-31 03:58:44,311 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-31 03:58:44,311 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-31 03:58:44,312 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-31 03:58:44,312 INFO L133 SettingsManager]: * Use bitvectors instead of ints=true [2018-12-31 03:58:44,312 INFO L133 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2018-12-31 03:58:44,312 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-31 03:58:44,313 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-31 03:58:44,313 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-31 03:58:44,313 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-31 03:58:44,313 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-31 03:58:44,313 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-31 03:58:44,314 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-31 03:58:44,314 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-31 03:58:44,314 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-31 03:58:44,314 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-31 03:58:44,314 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-31 03:58:44,314 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-31 03:58:44,315 INFO L133 SettingsManager]: * Trace refinement strategy=WOLF [2018-12-31 03:58:44,315 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-31 03:58:44,315 INFO L133 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2018-12-31 03:58:44,315 INFO L133 SettingsManager]: * Logic for external solver=AUFBV [2018-12-31 03:58:44,315 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /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 -> 4284cb37841cd94fe17da64cc250a8a1e69c6375 [2018-12-31 03:58:44,383 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-31 03:58:44,400 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-31 03:58:44,409 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-31 03:58:44,411 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-31 03:58:44,412 INFO L276 PluginConnector]: CDTParser initialized [2018-12-31 03:58:44,412 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-12-31 03:58:44,483 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b357cfcb/72f44ea001d648efb5db9963b3953945/FLAG715c52e73 [2018-12-31 03:58:44,965 INFO L307 CDTParser]: Found 1 translation units. [2018-12-31 03:58:44,966 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/float-newlib/double_req_bl_1232a_true-unreach-call.c [2018-12-31 03:58:44,974 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b357cfcb/72f44ea001d648efb5db9963b3953945/FLAG715c52e73 [2018-12-31 03:58:45,318 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b357cfcb/72f44ea001d648efb5db9963b3953945 [2018-12-31 03:58:45,323 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-31 03:58:45,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-31 03:58:45,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:45,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-31 03:58:45,331 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-31 03:58:45,332 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,336 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b63d025 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45, skipping insertion in model container [2018-12-31 03:58:45,336 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,346 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-31 03:58:45,368 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-31 03:58:45,641 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:45,647 INFO L191 MainTranslator]: Completed pre-run [2018-12-31 03:58:45,698 INFO L204 PostProcessor]: Analyzing one entry point: main [2018-12-31 03:58:45,748 INFO L195 MainTranslator]: Completed translation [2018-12-31 03:58:45,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45 WrapperNode [2018-12-31 03:58:45,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-31 03:58:45,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:45,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-31 03:58:45,750 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-31 03:58:45,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-31 03:58:45,809 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-31 03:58:45,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-31 03:58:45,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-31 03:58:45,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,885 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,891 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,902 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (1/1) ... [2018-12-31 03:58:45,927 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-31 03:58:45,928 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-31 03:58:45,928 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-31 03:58:45,928 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-31 03:58:45,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (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 [2018-12-31 03:58:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2018-12-31 03:58:46,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2018-12-31 03:58:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2018-12-31 03:58:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-31 03:58:46,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-31 03:58:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-31 03:58:46,272 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:46,525 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:46,666 WARN L317 ript$VariableManager]: TermVariabe |q#valueAsBitvector| not constructed by VariableManager. Cannot ensure absence of name clashes. [2018-12-31 03:58:46,731 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-31 03:58:46,731 INFO L280 CfgBuilder]: Removed 18 assue(true) statements. [2018-12-31 03:58:46,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:46 BoogieIcfgContainer [2018-12-31 03:58:46,732 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-31 03:58:46,733 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-31 03:58:46,733 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-31 03:58:46,737 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-31 03:58:46,737 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.12 03:58:45" (1/3) ... [2018-12-31 03:58:46,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf8802f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:46, skipping insertion in model container [2018-12-31 03:58:46,738 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.12 03:58:45" (2/3) ... [2018-12-31 03:58:46,738 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bf8802f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.12 03:58:46, skipping insertion in model container [2018-12-31 03:58:46,739 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:46" (3/3) ... [2018-12-31 03:58:46,740 INFO L112 eAbstractionObserver]: Analyzing ICFG double_req_bl_1232a_true-unreach-call.c [2018-12-31 03:58:46,751 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-31 03:58:46,762 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-31 03:58:46,781 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-31 03:58:46,815 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-31 03:58:46,818 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-31 03:58:46,818 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-31 03:58:46,818 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-31 03:58:46,818 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-31 03:58:46,818 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-31 03:58:46,818 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-31 03:58:46,819 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-31 03:58:46,819 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-31 03:58:46,834 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states. [2018-12-31 03:58:46,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-31 03:58:46,840 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:46,841 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:46,844 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -958075201, now seen corresponding path program 1 times [2018-12-31 03:58:46,856 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:46,857 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:58:46,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:46,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:46,942 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:46,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:46,955 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:46,968 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:46,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-31 03:58:46,971 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-31 03:58:46,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-31 03:58:46,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:46,989 INFO L87 Difference]: Start difference. First operand 32 states. Second operand 2 states. [2018-12-31 03:58:47,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:47,010 INFO L93 Difference]: Finished difference Result 62 states and 98 transitions. [2018-12-31 03:58:47,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-31 03:58:47,012 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2018-12-31 03:58:47,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:47,024 INFO L225 Difference]: With dead ends: 62 [2018-12-31 03:58:47,024 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 03:58:47,027 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-31 03:58:47,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 03:58:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-31 03:58:47,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 03:58:47,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 40 transitions. [2018-12-31 03:58:47,067 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 40 transitions. Word has length 10 [2018-12-31 03:58:47,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:47,067 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 40 transitions. [2018-12-31 03:58:47,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-31 03:58:47,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 40 transitions. [2018-12-31 03:58:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-31 03:58:47,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:47,068 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:47,069 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:47,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:47,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1001584898, now seen corresponding path program 1 times [2018-12-31 03:58:47,070 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:47,070 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:58:47,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:47,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:47,140 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:47,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:47,238 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:47,250 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:47,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:47,252 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:47,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:47,253 INFO L87 Difference]: Start difference. First operand 29 states and 40 transitions. Second operand 4 states. [2018-12-31 03:58:47,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:47,503 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-12-31 03:58:47,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:47,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2018-12-31 03:58:47,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:47,506 INFO L225 Difference]: With dead ends: 53 [2018-12-31 03:58:47,506 INFO L226 Difference]: Without dead ends: 44 [2018-12-31 03:58:47,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:47,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-31 03:58:47,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 31. [2018-12-31 03:58:47,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 03:58:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2018-12-31 03:58:47,515 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 11 [2018-12-31 03:58:47,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:47,516 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2018-12-31 03:58:47,516 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:47,517 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2018-12-31 03:58:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-31 03:58:47,517 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:47,518 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:47,518 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:47,518 INFO L82 PathProgramCache]: Analyzing trace with hash 502201410, now seen corresponding path program 1 times [2018-12-31 03:58:47,520 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:47,520 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:58:47,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:47,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:47,598 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:47,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:47,718 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:47,731 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:47,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:47,732 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:47,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:47,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:47,733 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand 4 states. [2018-12-31 03:58:47,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:47,941 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2018-12-31 03:58:47,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:47,949 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-12-31 03:58:47,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:47,950 INFO L225 Difference]: With dead ends: 61 [2018-12-31 03:58:47,951 INFO L226 Difference]: Without dead ends: 39 [2018-12-31 03:58:47,951 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-12-31 03:58:47,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2018-12-31 03:58:47,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 03:58:47,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2018-12-31 03:58:47,963 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 12 [2018-12-31 03:58:47,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:47,963 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-12-31 03:58:47,963 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:47,963 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2018-12-31 03:58:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-31 03:58:47,964 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:47,964 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:47,968 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:47,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:47,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1951233721, now seen corresponding path program 1 times [2018-12-31 03:58:47,969 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:47,969 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:58:47,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:48,038 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:48,059 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:48,060 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:48,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:48,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:48,071 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:48,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:48,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:48,072 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand 4 states. [2018-12-31 03:58:48,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:48,289 INFO L93 Difference]: Finished difference Result 52 states and 62 transitions. [2018-12-31 03:58:48,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:48,290 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-31 03:58:48,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:48,291 INFO L225 Difference]: With dead ends: 52 [2018-12-31 03:58:48,291 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 03:58:48,292 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:48,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 03:58:48,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 28. [2018-12-31 03:58:48,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-12-31 03:58:48,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2018-12-31 03:58:48,298 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 13 [2018-12-31 03:58:48,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:48,298 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2018-12-31 03:58:48,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:48,299 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2018-12-31 03:58:48,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-31 03:58:48,300 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:48,300 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:48,301 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:48,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:48,302 INFO L82 PathProgramCache]: Analyzing trace with hash 1012446717, now seen corresponding path program 1 times [2018-12-31 03:58:48,302 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:48,302 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy 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 [2018-12-31 03:58:48,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:48,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:48,384 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:48,438 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:48,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:48,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:48,449 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:48,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:48,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:48,450 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand 4 states. [2018-12-31 03:58:48,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:48,563 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2018-12-31 03:58:48,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:48,565 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-31 03:58:48,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:48,567 INFO L225 Difference]: With dead ends: 52 [2018-12-31 03:58:48,567 INFO L226 Difference]: Without dead ends: 43 [2018-12-31 03:58:48,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-12-31 03:58:48,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 30. [2018-12-31 03:58:48,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-31 03:58:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2018-12-31 03:58:48,574 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 16 [2018-12-31 03:58:48,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:48,574 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2018-12-31 03:58:48,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2018-12-31 03:58:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-31 03:58:48,575 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:48,575 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:48,575 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:48,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:48,578 INFO L82 PathProgramCache]: Analyzing trace with hash 874935118, now seen corresponding path program 1 times [2018-12-31 03:58:48,578 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:48,578 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:48,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:48,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:48,654 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:48,709 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:48,719 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:48,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-31 03:58:48,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-31 03:58:48,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-31 03:58:48,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:48,721 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand 5 states. [2018-12-31 03:58:49,066 WARN L181 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-12-31 03:58:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:49,168 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2018-12-31 03:58:49,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-31 03:58:49,170 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-12-31 03:58:49,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:49,171 INFO L225 Difference]: With dead ends: 43 [2018-12-31 03:58:49,171 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 03:58:49,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-31 03:58:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 03:58:49,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-31 03:58:49,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 03:58:49,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2018-12-31 03:58:49,180 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 17 [2018-12-31 03:58:49,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:49,180 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-12-31 03:58:49,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-31 03:58:49,181 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2018-12-31 03:58:49,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:58:49,181 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:49,183 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:49,183 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:49,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:49,184 INFO L82 PathProgramCache]: Analyzing trace with hash -414082333, now seen corresponding path program 1 times [2018-12-31 03:58:49,185 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:49,185 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2018-12-31 03:58:49,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:49,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:49,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:49,328 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:49,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:49,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-31 03:58:49,341 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-31 03:58:49,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-31 03:58:49,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 03:58:49,342 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 3 states. [2018-12-31 03:58:49,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:49,405 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2018-12-31 03:58:49,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-31 03:58:49,411 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2018-12-31 03:58:49,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:49,412 INFO L225 Difference]: With dead ends: 39 [2018-12-31 03:58:49,412 INFO L226 Difference]: Without dead ends: 29 [2018-12-31 03:58:49,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-31 03:58:49,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-12-31 03:58:49,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-12-31 03:58:49,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-31 03:58:49,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-31 03:58:49,423 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 18 [2018-12-31 03:58:49,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:49,424 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-31 03:58:49,424 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-31 03:58:49,424 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-31 03:58:49,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:58:49,424 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:49,426 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:49,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:49,427 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:49,427 INFO L82 PathProgramCache]: Analyzing trace with hash -356824031, now seen corresponding path program 1 times [2018-12-31 03:58:49,428 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:49,428 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:49,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:49,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:49,524 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:49,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:49,592 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:49,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:49,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-31 03:58:49,605 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-31 03:58:49,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-31 03:58:49,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-31 03:58:49,606 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 6 states. [2018-12-31 03:58:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:49,795 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2018-12-31 03:58:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-31 03:58:49,796 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2018-12-31 03:58:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:49,797 INFO L225 Difference]: With dead ends: 41 [2018-12-31 03:58:49,797 INFO L226 Difference]: Without dead ends: 38 [2018-12-31 03:58:49,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:58:49,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-12-31 03:58:49,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2018-12-31 03:58:49,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-31 03:58:49,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2018-12-31 03:58:49,807 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 18 [2018-12-31 03:58:49,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:49,808 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2018-12-31 03:58:49,808 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-31 03:58:49,808 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2018-12-31 03:58:49,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-31 03:58:49,809 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:49,809 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:49,809 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:49,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:49,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1049593954, now seen corresponding path program 1 times [2018-12-31 03:58:49,810 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:49,811 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:49,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:49,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:49,890 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:49,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:49,912 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:49,929 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:49,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-31 03:58:49,930 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-31 03:58:49,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-31 03:58:49,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-31 03:58:49,930 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2018-12-31 03:58:49,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:49,995 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-12-31 03:58:49,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-31 03:58:49,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-31 03:58:49,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:49,997 INFO L225 Difference]: With dead ends: 51 [2018-12-31 03:58:49,997 INFO L226 Difference]: Without dead ends: 42 [2018-12-31 03:58:49,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-31 03:58:49,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-12-31 03:58:50,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 27. [2018-12-31 03:58:50,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-12-31 03:58:50,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-12-31 03:58:50,006 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 18 [2018-12-31 03:58:50,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:50,006 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-12-31 03:58:50,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-31 03:58:50,007 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-12-31 03:58:50,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-31 03:58:50,007 INFO L394 BasicCegarLoop]: Found error trace [2018-12-31 03:58:50,008 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-31 03:58:50,008 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-31 03:58:50,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2018-12-31 03:58:50,008 INFO L82 PathProgramCache]: Analyzing trace with hash -1524231306, now seen corresponding path program 1 times [2018-12-31 03:58:50,011 INFO L223 ckRefinementStrategy]: Switched to mode MATHSAT_FPBP [2018-12-31 03:58:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy WolfRefinementStrategy No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat Starting monitored process 11 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with mathsat -unsat_core_generation=3 [2018-12-31 03:58:50,017 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-31 03:58:50,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-31 03:58:50,110 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-31 03:58:50,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-31 03:58:50,246 INFO L312 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2018-12-31 03:58:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-31 03:58:50,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-12-31 03:58:50,258 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-31 03:58:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-31 03:58:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-12-31 03:58:50,259 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 10 states. [2018-12-31 03:58:50,588 WARN L181 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-12-31 03:58:50,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-31 03:58:50,847 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-12-31 03:58:50,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-31 03:58:50,849 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2018-12-31 03:58:50,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-31 03:58:50,850 INFO L225 Difference]: With dead ends: 27 [2018-12-31 03:58:50,850 INFO L226 Difference]: Without dead ends: 0 [2018-12-31 03:58:50,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2018-12-31 03:58:50,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-31 03:58:50,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-31 03:58:50,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-31 03:58:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-31 03:58:50,852 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2018-12-31 03:58:50,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-31 03:58:50,853 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-31 03:58:50,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-31 03:58:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-31 03:58:50,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-31 03:58:50,859 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-31 03:58:50,920 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 03:58:50,983 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-31 03:58:51,102 WARN L181 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-12-31 03:58:51,439 WARN L181 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2018-12-31 03:58:51,610 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2018-12-31 03:58:51,610 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-31 03:58:51,610 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 26) no Hoare annotation was computed. [2018-12-31 03:58:51,611 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 21 26) the Hoare annotation is: (and (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) [2018-12-31 03:58:51,611 INFO L448 ceAbstractionStarter]: For program point L21-3(lines 18 43) no Hoare annotation was computed. [2018-12-31 03:58:51,611 INFO L448 ceAbstractionStarter]: For program point L21-5(lines 21 26) no Hoare annotation was computed. [2018-12-31 03:58:51,611 INFO L444 ceAbstractionStarter]: At program point L21-6(lines 21 26) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x))) [2018-12-31 03:58:51,611 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-12-31 03:58:51,611 INFO L448 ceAbstractionStarter]: For program point L46(lines 46 47) no Hoare annotation was computed. [2018-12-31 03:58:51,611 INFO L448 ceAbstractionStarter]: For program point L21-7(lines 18 43) no Hoare annotation was computed. [2018-12-31 03:58:51,612 INFO L448 ceAbstractionStarter]: For program point L79-2(lines 79 82) no Hoare annotation was computed. [2018-12-31 03:58:51,612 INFO L448 ceAbstractionStarter]: For program point L38(lines 38 42) no Hoare annotation was computed. [2018-12-31 03:58:51,612 INFO L448 ceAbstractionStarter]: For program point L38-1(lines 38 42) no Hoare annotation was computed. [2018-12-31 03:58:51,612 INFO L444 ceAbstractionStarter]: At program point L63(lines 54 64) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___signbit_double_~x .cse0) (exists ((|v_q#valueAsBitvector_5| (_ BitVec 64))) (and (= ((_ extract 63 32) |v_q#valueAsBitvector_5|) ULTIMATE.start___signbit_double_~msw~1) (= (fp ((_ extract 63 63) |v_q#valueAsBitvector_5|) ((_ extract 62 52) |v_q#valueAsBitvector_5|) ((_ extract 51 0) |v_q#valueAsBitvector_5|)) (fp.neg (_ +zero 11 53))))) (= (_ bv1 32) |ULTIMATE.start___signbit_double_#res|) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) |ULTIMATE.start_main_#t~short11|)) [2018-12-31 03:58:51,612 INFO L448 ceAbstractionStarter]: For program point L80(line 80) no Hoare annotation was computed. [2018-12-31 03:58:51,612 INFO L448 ceAbstractionStarter]: For program point L31(lines 31 42) no Hoare annotation was computed. [2018-12-31 03:58:51,612 INFO L448 ceAbstractionStarter]: For program point L31-1(lines 31 42) no Hoare annotation was computed. [2018-12-31 03:58:51,613 INFO L448 ceAbstractionStarter]: For program point L48(lines 48 49) no Hoare annotation was computed. [2018-12-31 03:58:51,613 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2018-12-31 03:58:51,613 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 57 61) no Hoare annotation was computed. [2018-12-31 03:58:51,613 INFO L444 ceAbstractionStarter]: At program point L57-2(lines 57 61) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (= ULTIMATE.start_main_~res~0 .cse0) (= ULTIMATE.start___signbit_double_~x .cse0) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) |ULTIMATE.start_main_#t~short11|)) [2018-12-31 03:58:51,613 INFO L448 ceAbstractionStarter]: For program point L57-3(lines 57 61) no Hoare annotation was computed. [2018-12-31 03:58:51,613 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-31 03:58:51,614 INFO L444 ceAbstractionStarter]: At program point L42(lines 18 43) the Hoare annotation is: (and (= ULTIMATE.start_fmin_double_~y (fp.neg (_ +zero 11 53))) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x) (let ((.cse0 (= ULTIMATE.start___fpclassify_double_~x (_ +zero 11 53))) (.cse1 (exists ((v_prenex_11 (_ BitVec 64))) (and (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) v_prenex_11)) (= (_ +zero 11 53) (fp ((_ extract 63 63) v_prenex_11) ((_ extract 62 52) v_prenex_11) ((_ extract 51 0) v_prenex_11))))))) (or (and (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) .cse0 .cse1) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32)) .cse1)))) [2018-12-31 03:58:51,614 INFO L444 ceAbstractionStarter]: At program point L42-1(lines 18 43) the Hoare annotation is: (let ((.cse4 (fp.neg (_ +zero 11 53)))) (let ((.cse0 (= ULTIMATE.start_fmin_double_~y .cse4)) (.cse1 (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|))))) (.cse2 (= ULTIMATE.start___fpclassify_double_~x .cse4)) (.cse3 (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x))) (or (and .cse0 .cse1 .cse2 .cse3 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967293 32)) (_ bv0 32))) (and .cse0 (= (bvadd |ULTIMATE.start___fpclassify_double_#res| (_ bv4294967294 32)) (_ bv0 32)) .cse1 .cse2 .cse3)))) [2018-12-31 03:58:51,614 INFO L448 ceAbstractionStarter]: For program point L34(lines 34 42) no Hoare annotation was computed. [2018-12-31 03:58:51,614 INFO L448 ceAbstractionStarter]: For program point L34-1(lines 34 42) no Hoare annotation was computed. [2018-12-31 03:58:51,614 INFO L451 ceAbstractionStarter]: At program point L84(lines 66 85) the Hoare annotation is: true [2018-12-31 03:58:51,614 INFO L448 ceAbstractionStarter]: For program point L51(line 51) no Hoare annotation was computed. [2018-12-31 03:58:51,615 INFO L448 ceAbstractionStarter]: For program point L51-2(line 51) no Hoare annotation was computed. [2018-12-31 03:58:51,615 INFO L444 ceAbstractionStarter]: At program point L51-3(lines 45 52) the Hoare annotation is: (let ((.cse0 (fp.neg (_ +zero 11 53)))) (and (= ULTIMATE.start_fmin_double_~y .cse0) (= |ULTIMATE.start_fmin_double_#res| .cse0) (exists ((|v_q#valueAsBitvector_4| (_ BitVec 64))) (and (= (fp.neg (_ +zero 11 53)) (fp ((_ extract 63 63) |v_q#valueAsBitvector_4|) ((_ extract 62 52) |v_q#valueAsBitvector_4|) ((_ extract 51 0) |v_q#valueAsBitvector_4|))) (= ULTIMATE.start___fpclassify_double_~msw~0 ((_ extract 63 32) |v_q#valueAsBitvector_4|)))) (= ULTIMATE.start___fpclassify_double_~x .cse0) (= (_ +zero 11 53) ULTIMATE.start_fmin_double_~x))) [2018-12-31 03:58:51,615 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 80) no Hoare annotation was computed. [2018-12-31 03:58:51,622 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,623 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,624 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,625 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,625 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,633 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,634 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,637 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,638 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,640 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,642 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,643 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,646 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,647 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,648 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,651 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,653 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,653 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,653 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,653 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,654 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,655 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,658 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,661 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,662 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,664 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,665 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,667 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,668 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.12 03:58:51 BoogieIcfgContainer [2018-12-31 03:58:51,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-31 03:58:51,672 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-31 03:58:51,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-31 03:58:51,673 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-31 03:58:51,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.12 03:58:46" (3/4) ... [2018-12-31 03:58:51,679 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-31 03:58:51,694 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2018-12-31 03:58:51,694 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-31 03:58:51,695 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-31 03:58:51,728 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 && x == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]))) || ((x == ~Pluszero~LONGDOUBLE() && ~bvadd64(\result, 4294967293bv32) == 0bv32) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0])))) [2018-12-31 03:58:51,729 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x [2018-12-31 03:58:51,729 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux [2018-12-31 03:58:51,731 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && 1bv32 == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux [2018-12-31 03:58:51,731 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && ~bvadd64(\result, 4294967293bv32) == 0bv32) || ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) [2018-12-31 03:58:51,779 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-12-31 03:58:51,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-31 03:58:51,784 INFO L168 Benchmark]: Toolchain (without parser) took 6460.59 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 951.4 MB in the beginning and 822.3 MB in the end (delta: 129.1 MB). Peak memory consumption was 260.1 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:51,785 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-31 03:58:51,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 423.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:51,787 INFO L168 Benchmark]: Boogie Procedure Inliner took 58.26 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:51,788 INFO L168 Benchmark]: Boogie Preprocessor took 119.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:51,788 INFO L168 Benchmark]: RCFGBuilder took 804.04 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:51,790 INFO L168 Benchmark]: TraceAbstraction took 4939.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 828.9 MB in the end (delta: 259.3 MB). Peak memory consumption was 259.3 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:51,790 INFO L168 Benchmark]: Witness Printer took 110.57 ms. Allocated memory is still 1.2 GB. Free memory was 828.9 MB in the beginning and 822.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2018-12-31 03:58:51,795 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 423.81 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 58.26 ms. Allocated memory is still 1.0 GB. Free memory was 940.6 MB in the beginning and 935.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 119.00 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 935.3 MB in the beginning and 1.1 GB in the end (delta: -177.9 MB). Peak memory consumption was 13.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 804.04 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: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4939.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 828.9 MB in the end (delta: 259.3 MB). Peak memory consumption was 259.3 MB. Max. memory is 11.5 GB. * Witness Printer took 110.57 ms. Allocated memory is still 1.2 GB. Free memory was 828.9 MB in the beginning and 822.3 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 80]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 54]: Loop Invariant [2018-12-31 03:58:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,804 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,812 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,813 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_5,QUANTIFIED] [2018-12-31 03:58:51,814 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,818 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_5 : bv64 :: v_q#valueAsBitvector_5[63:32] == msw && ~fp~LONGDOUBLE(v_q#valueAsBitvector_5[63:63], v_q#valueAsBitvector_5[62:52], v_q#valueAsBitvector_5[51:0]) == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()))) && 1bv32 == \result) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 18]: Loop Invariant [2018-12-31 03:58:51,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,822 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,823 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,826 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] [2018-12-31 03:58:51,827 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_11,QUANTIFIED] Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && (((~bvadd64(\result, 4294967294bv32) == 0bv32 && x == ~Pluszero~LONGDOUBLE()) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0]))) || ((x == ~Pluszero~LONGDOUBLE() && ~bvadd64(\result, 4294967293bv32) == 0bv32) && (\exists v_prenex_11 : bv64 :: msw == v_prenex_11[63:32] && ~Pluszero~LONGDOUBLE() == ~fp~LONGDOUBLE(v_prenex_11[63:63], v_prenex_11[62:52], v_prenex_11[51:0])))) - InvariantResult [Line: 45]: Loop Invariant [2018-12-31 03:58:51,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,828 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,834 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: (((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x - InvariantResult [Line: 57]: Loop Invariant [2018-12-31 03:58:51,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,835 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,836 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && \result == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && res == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && aux-res == -0.0 && __signbit_double(res) == 1-aux - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == x) && x == ~Pluszero~LONGDOUBLE() - InvariantResult [Line: 18]: Loop Invariant [2018-12-31 03:58:51,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,837 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,838 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,841 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,842 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,846 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] [2018-12-31 03:58:51,847 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_q#valueAsBitvector_4,QUANTIFIED] Derived loop invariant: ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) && ~bvadd64(\result, 4294967293bv32) == 0bv32) || ((((y == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) && ~bvadd64(\result, 4294967294bv32) == 0bv32) && (\exists v_q#valueAsBitvector_4 : bv64 :: ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE()) == ~fp~LONGDOUBLE(v_q#valueAsBitvector_4[63:63], v_q#valueAsBitvector_4[62:52], v_q#valueAsBitvector_4[51:0]) && msw == v_q#valueAsBitvector_4[63:32])) && x == ~fp.neg~DOUBLE(~Pluszero~LONGDOUBLE())) && ~Pluszero~LONGDOUBLE() == x) - InvariantResult [Line: 66]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 32 locations, 1 error locations. SAFE Result, 4.8s OverallTime, 10 OverallIterations, 1 TraceHistogramMax, 2.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 344 SDtfs, 238 SDslu, 501 SDs, 0 SdLazy, 174 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 162 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 72 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 8 PreInvPairs, 16 NumberOfFragments, 281 HoareAnnotationTreeSize, 8 FomulaSimplifications, 388 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 8 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 155 NumberOfCodeBlocks, 155 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 145 ConstructedInterpolants, 8 QuantifiedInterpolants, 7690 SizeOfPredicates, 37 NumberOfNonLiveVariables, 558 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...