./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_1092b.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1092b.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fce76024adc68e21e1cc196dab3e80b460687e3a9e05290958802f4f588d42d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:13:11,345 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:13:11,347 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:13:11,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:13:11,370 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:13:11,370 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:13:11,373 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:13:11,378 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:13:11,380 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:13:11,383 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:13:11,384 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:13:11,385 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:13:11,385 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:13:11,387 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:13:11,388 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:13:11,390 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:13:11,390 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:13:11,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:13:11,394 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:13:11,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:13:11,398 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:13:11,399 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:13:11,400 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:13:11,401 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:13:11,402 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:13:11,407 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:13:11,407 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:13:11,407 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:13:11,408 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:13:11,408 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:13:11,409 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:13:11,409 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:13:11,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:13:11,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:13:11,411 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:13:11,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:13:11,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:13:11,413 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:13:11,413 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:13:11,413 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:13:11,414 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:13:11,415 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:13:11,416 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-12 03:13:11,437 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:13:11,439 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:13:11,439 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:13:11,440 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:13:11,441 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:13:11,441 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:13:11,441 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:13:11,441 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:13:11,441 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:13:11,442 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:13:11,442 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:13:11,442 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:13:11,442 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:13:11,443 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:13:11,443 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:13:11,443 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:13:11,443 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:13:11,443 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:13:11,443 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:13:11,444 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:13:11,444 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:13:11,445 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:13:11,445 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:13:11,445 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:13:11,445 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:11,445 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:13:11,446 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:13:11,446 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:13:11,446 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:13:11,446 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:13:11,446 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:13:11,447 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:13:11,447 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:13:11,447 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 6fce76024adc68e21e1cc196dab3e80b460687e3a9e05290958802f4f588d42d [2022-07-12 03:13:11,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:13:11,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:13:11,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:13:11,667 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:13:11,667 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:13:11,668 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1092b.c [2022-07-12 03:13:11,731 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d26d19f5/dcb9739d579e4828b97a2cad270dd422/FLAG77fe4c07d [2022-07-12 03:13:12,127 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:13:12,127 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092b.c [2022-07-12 03:13:12,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d26d19f5/dcb9739d579e4828b97a2cad270dd422/FLAG77fe4c07d [2022-07-12 03:13:12,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d26d19f5/dcb9739d579e4828b97a2cad270dd422 [2022-07-12 03:13:12,154 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:13:12,155 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:13:12,170 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:12,170 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:13:12,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:13:12,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,177 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@445836fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12, skipping insertion in model container [2022-07-12 03:13:12,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,191 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:13:12,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:13:12,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092b.c[1751,1764] [2022-07-12 03:13:12,446 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:12,452 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:13:12,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092b.c[1751,1764] [2022-07-12 03:13:12,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:12,504 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:13:12,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12 WrapperNode [2022-07-12 03:13:12,510 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:12,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:12,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:13:12,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:13:12,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,535 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,566 INFO L137 Inliner]: procedures = 16, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-07-12 03:13:12,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:12,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:13:12,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:13:12,573 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:13:12,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,587 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,619 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,621 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:13:12,622 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:13:12,622 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:13:12,622 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:13:12,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (1/1) ... [2022-07-12 03:13:12,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:12,644 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:13:12,653 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:13:12,672 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:13:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:13:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:13:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:13:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 03:13:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:13:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:13:12,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:13:12,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:13:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:13:12,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:13:12,744 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:13:12,745 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:13:13,054 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:13:13,073 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:13:13,074 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:13:13,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:13 BoogieIcfgContainer [2022-07-12 03:13:13,075 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:13:13,081 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:13:13,081 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:13:13,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:13:13,084 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:13:12" (1/3) ... [2022-07-12 03:13:13,085 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb5b6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:13, skipping insertion in model container [2022-07-12 03:13:13,085 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:12" (2/3) ... [2022-07-12 03:13:13,086 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bb5b6b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:13, skipping insertion in model container [2022-07-12 03:13:13,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:13" (3/3) ... [2022-07-12 03:13:13,087 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092b.c [2022-07-12 03:13:13,113 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:13:13,114 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:13:13,160 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:13:13,198 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@67cd8882, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@68085cc9 [2022-07-12 03:13:13,198 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:13:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:13,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:13:13,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:13,209 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:13,209 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:13,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:13,225 INFO L85 PathProgramCache]: Analyzing trace with hash -2022248449, now seen corresponding path program 1 times [2022-07-12 03:13:13,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:13,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562466568] [2022-07-12 03:13:13,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:13,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:13,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:13,372 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:13,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:13:13,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562466568] [2022-07-12 03:13:13,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562466568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:13,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:13,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:13:13,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56458080] [2022-07-12 03:13:13,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:13,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:13:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:13:13,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:13:13,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:13:13,426 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:13,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:13,437 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2022-07-12 03:13:13,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:13:13,438 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 03:13:13,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:13,444 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:13:13,444 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:13:13,446 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:13:13,448 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:13,449 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:13,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:13:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 03:13:13,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:13,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-07-12 03:13:13,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2022-07-12 03:13:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:13,468 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-07-12 03:13:13,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:13,469 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-07-12 03:13:13,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:13:13,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:13,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:13,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:13:13,470 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:13,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:13,470 INFO L85 PathProgramCache]: Analyzing trace with hash -62588350, now seen corresponding path program 1 times [2022-07-12 03:13:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:13:13,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964039307] [2022-07-12 03:13:13,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:13,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:13:13,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:13:13,558 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:13:13,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:13:13,668 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:13:13,669 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:13:13,670 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:13:13,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:13:13,677 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 03:13:13,679 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:13:13,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:13:13 BoogieIcfgContainer [2022-07-12 03:13:13,703 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:13:13,705 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:13:13,705 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:13:13,715 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:13:13,716 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:13" (3/4) ... [2022-07-12 03:13:13,723 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:13:13,723 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:13:13,724 INFO L158 Benchmark]: Toolchain (without parser) took 1568.30ms. Allocated memory is still 109.1MB. Free memory was 78.2MB in the beginning and 71.8MB in the end (delta: 6.4MB). Peak memory consumption was 6.2MB. Max. memory is 16.1GB. [2022-07-12 03:13:13,724 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:13,726 INFO L158 Benchmark]: CACSL2BoogieTranslator took 341.41ms. Allocated memory is still 109.1MB. Free memory was 78.2MB in the beginning and 83.5MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:13:13,729 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.92ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 81.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:13:13,730 INFO L158 Benchmark]: Boogie Preprocessor took 48.06ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 80.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:13,730 INFO L158 Benchmark]: RCFGBuilder took 453.76ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 67.2MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-12 03:13:13,740 INFO L158 Benchmark]: TraceAbstraction took 621.87ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 72.3MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:13,740 INFO L158 Benchmark]: Witness Printer took 18.63ms. Allocated memory is still 109.1MB. Free memory was 72.3MB in the beginning and 71.8MB in the end (delta: 586.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:13,742 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 83.9MB. Free memory is still 39.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 341.41ms. Allocated memory is still 109.1MB. Free memory was 78.2MB in the beginning and 83.5MB in the end (delta: -5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.92ms. Allocated memory is still 109.1MB. Free memory was 83.5MB in the beginning and 81.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.06ms. Allocated memory is still 109.1MB. Free memory was 81.9MB in the beginning and 80.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 453.76ms. Allocated memory is still 109.1MB. Free memory was 80.4MB in the beginning and 67.2MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 621.87ms. Allocated memory is still 109.1MB. Free memory was 66.7MB in the beginning and 72.3MB in the end (delta: -5.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 18.63ms. Allocated memory is still 109.1MB. Free memory was 72.3MB in the beginning and 71.8MB in the end (delta: 586.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 83]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 82, overapproximation of bitwiseAnd at line 23. Possible FailurePath: [L13] static const float huge_ceil = 1.0e30; VAL [huge_ceil=1000000000000000000000000000000] [L78] float x = 0.0f; [L79] CALL, EXPR ceil_float(x) [L16] __int32_t i0, j0; [L17] __uint32_t i, ix; VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, x=0] [L19] ieee_float_shape_type gf_u; [L20] gf_u.value = (x) [L21] EXPR gf_u.word [L21] (i0) = gf_u.word [L23] ix = (i0 & 0x7fffffff) [L24] j0 = (ix >> 23) - 0x7f VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=0] [L25] COND FALSE !(j0 < 23) VAL [\old(x)=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=0] [L45] COND FALSE !(!((ix) < 0x7f800000L)) [L48] return x; VAL [\old(x)=0, \result=0, huge_ceil=1000000000000000000000000000000, i=-18014398509481984, i0=6, j0=2147483521, x=0] [L79] RET, EXPR ceil_float(x) [L79] float res = ceil_float(x); [L82] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [huge_ceil=1000000000000000000000000000000, res=0, res == 0.0f && __signbit_float(res) == 0=0, x=0] [L82] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L83] reach_error() VAL [huge_ceil=1000000000000000000000000000000, res=0, x=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 39 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 39 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 21 NumberOfCodeBlocks, 21 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 9 ConstructedInterpolants, 0 QuantifiedInterpolants, 9 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-12 03:13:13,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_1092b.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(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6fce76024adc68e21e1cc196dab3e80b460687e3a9e05290958802f4f588d42d --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:13:16,584 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:13:16,587 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:13:16,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:13:16,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:13:16,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:13:16,617 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:13:16,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:13:16,621 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:13:16,624 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:13:16,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:13:16,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:13:16,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:13:16,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:13:16,632 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:13:16,634 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:13:16,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:13:16,635 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:13:16,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:13:16,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:13:16,641 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:13:16,642 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:13:16,644 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:13:16,644 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:13:16,645 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:13:16,650 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:13:16,650 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:13:16,651 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:13:16,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:13:16,652 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:13:16,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:13:16,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:13:16,654 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:13:16,654 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:13:16,655 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:13:16,656 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:13:16,656 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:13:16,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:13:16,657 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:13:16,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:13:16,657 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:13:16,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:13:16,662 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-12 03:13:16,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:13:16,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:13:16,691 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:13:16,691 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:13:16,692 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:13:16,692 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:13:16,693 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:13:16,693 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:13:16,693 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:13:16,694 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:13:16,694 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:13:16,694 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:13:16,694 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:13:16,694 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:13:16,694 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:13:16,695 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:13:16,695 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:13:16,695 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:13:16,695 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:13:16,720 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:13:16,720 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:13:16,720 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:13:16,720 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:13:16,720 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:13:16,720 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:13:16,720 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:16,721 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:13:16,721 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:13:16,722 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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(reach_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 -> 6fce76024adc68e21e1cc196dab3e80b460687e3a9e05290958802f4f588d42d [2022-07-12 03:13:17,002 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:13:17,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:13:17,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:13:17,021 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:13:17,021 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:13:17,022 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_1092b.c [2022-07-12 03:13:17,083 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e329e37/65ef8aebef1a4c89b494c1b4c17e1b4d/FLAG78d98b44d [2022-07-12 03:13:17,512 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:13:17,514 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092b.c [2022-07-12 03:13:17,518 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e329e37/65ef8aebef1a4c89b494c1b4c17e1b4d/FLAG78d98b44d [2022-07-12 03:13:17,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41e329e37/65ef8aebef1a4c89b494c1b4c17e1b4d [2022-07-12 03:13:17,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:13:17,535 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:13:17,537 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:17,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:13:17,539 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:13:17,540 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e4bb6d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17, skipping insertion in model container [2022-07-12 03:13:17,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,553 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:13:17,563 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:13:17,740 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092b.c[1751,1764] [2022-07-12 03:13:17,743 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:17,754 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:13:17,784 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_1092b.c[1751,1764] [2022-07-12 03:13:17,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:13:17,795 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:13:17,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17 WrapperNode [2022-07-12 03:13:17,796 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:13:17,797 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:17,797 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:13:17,797 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:13:17,801 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,820 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,841 INFO L137 Inliner]: procedures = 19, calls = 21, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2022-07-12 03:13:17,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:13:17,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:13:17,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:13:17,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:13:17,849 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,849 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,858 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:13:17,886 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:13:17,886 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:13:17,886 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:13:17,887 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (1/1) ... [2022-07-12 03:13:17,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:13:17,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:13:17,909 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 03:13:17,931 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 03:13:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:13:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:13:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:13:17,956 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-12 03:13:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:13:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:13:17,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:13:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-12 03:13:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:13:17,957 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:13:18,036 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:13:18,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:13:18,459 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:13:18,464 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:13:18,465 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-07-12 03:13:18,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:18 BoogieIcfgContainer [2022-07-12 03:13:18,466 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:13:18,468 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:13:18,468 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:13:18,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:13:18,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:13:17" (1/3) ... [2022-07-12 03:13:18,470 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37da32e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:18, skipping insertion in model container [2022-07-12 03:13:18,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:13:17" (2/3) ... [2022-07-12 03:13:18,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37da32e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:13:18, skipping insertion in model container [2022-07-12 03:13:18,471 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:18" (3/3) ... [2022-07-12 03:13:18,472 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_1092b.c [2022-07-12 03:13:18,481 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:13:18,482 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:13:18,511 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:13:18,516 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1360cba2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5b70c636 [2022-07-12 03:13:18,516 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:13:18,519 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:18,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:13:18,523 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:18,524 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:18,524 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:18,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:18,528 INFO L85 PathProgramCache]: Analyzing trace with hash -2022248449, now seen corresponding path program 1 times [2022-07-12 03:13:18,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:18,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114173152] [2022-07-12 03:13:18,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:18,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:18,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:18,564 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:18,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-12 03:13:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:18,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 30 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:13:18,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:18,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:18,694 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:18,694 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:18,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114173152] [2022-07-12 03:13:18,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114173152] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:18,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:18,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:13:18,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542864090] [2022-07-12 03:13:18,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:18,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:13:18,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:18,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:13:18,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:13:18,734 INFO L87 Difference]: Start difference. First operand has 30 states, 28 states have (on average 1.6428571428571428) internal successors, (46), 29 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:18,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:18,744 INFO L93 Difference]: Finished difference Result 58 states and 90 transitions. [2022-07-12 03:13:18,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:13:18,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 03:13:18,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:18,750 INFO L225 Difference]: With dead ends: 58 [2022-07-12 03:13:18,750 INFO L226 Difference]: Without dead ends: 27 [2022-07-12 03:13:18,752 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:13:18,754 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:18,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:18,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-12 03:13:18,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-12 03:13:18,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3846153846153846) internal successors, (36), 26 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2022-07-12 03:13:18,774 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 10 [2022-07-12 03:13:18,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:18,774 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2022-07-12 03:13:18,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:18,774 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2022-07-12 03:13:18,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:13:18,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:18,775 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:18,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:18,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:18,984 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:18,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:18,985 INFO L85 PathProgramCache]: Analyzing trace with hash -62588350, now seen corresponding path program 1 times [2022-07-12 03:13:18,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:18,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847926167] [2022-07-12 03:13:18,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:18,986 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:18,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:18,987 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:18,989 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-12 03:13:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:19,043 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:13:19,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:19,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:19,110 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:19,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:19,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847926167] [2022-07-12 03:13:19,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847926167] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:19,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:19,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:13:19,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117944906] [2022-07-12 03:13:19,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:19,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:13:19,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:19,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:13:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:19,113 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:19,340 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-07-12 03:13:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:13:19,340 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 03:13:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:19,341 INFO L225 Difference]: With dead ends: 36 [2022-07-12 03:13:19,341 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:13:19,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:13:19,342 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 4 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:19,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 96 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 6 Unchecked, 0.2s Time] [2022-07-12 03:13:19,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:13:19,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:13:19,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.32) internal successors, (33), 25 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:19,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-07-12 03:13:19,346 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 11 [2022-07-12 03:13:19,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:19,346 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-12 03:13:19,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:19,346 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-07-12 03:13:19,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 03:13:19,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:19,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:19,358 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:19,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:19,556 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:19,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:19,556 INFO L85 PathProgramCache]: Analyzing trace with hash -1311186430, now seen corresponding path program 1 times [2022-07-12 03:13:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:19,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437435767] [2022-07-12 03:13:19,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:19,557 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:19,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:19,559 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:19,561 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-12 03:13:19,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:19,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-12 03:13:19,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:19,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:19,690 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:19,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:19,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437435767] [2022-07-12 03:13:19,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437435767] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:19,691 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:19,691 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:13:19,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645463030] [2022-07-12 03:13:19,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:19,692 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:13:19,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:19,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:13:19,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:19,693 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:19,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:19,787 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-07-12 03:13:19,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:13:19,800 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 03:13:19,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:19,800 INFO L225 Difference]: With dead ends: 38 [2022-07-12 03:13:19,800 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:13:19,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:13:19,801 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:19,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 71 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 4 Unchecked, 0.1s Time] [2022-07-12 03:13:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:13:19,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:13:19,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-07-12 03:13:19,804 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2022-07-12 03:13:19,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:19,804 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-07-12 03:13:19,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-07-12 03:13:19,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 03:13:19,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:19,805 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:19,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-12 03:13:20,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:20,030 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:20,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:20,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1612307429, now seen corresponding path program 1 times [2022-07-12 03:13:20,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:20,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506442451] [2022-07-12 03:13:20,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:20,032 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:20,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:20,033 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:20,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-12 03:13:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:20,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-12 03:13:20,140 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:20,234 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:20,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:20,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506442451] [2022-07-12 03:13:20,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506442451] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:20,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:20,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 03:13:20,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368392203] [2022-07-12 03:13:20,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:20,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:20,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:20,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:20,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:20,236 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:20,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:20,280 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-12 03:13:20,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:20,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 03:13:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:20,281 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:13:20,281 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:13:20,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:20,282 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 23 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:20,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 32 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:20,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:13:20,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:13:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 21 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:20,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-07-12 03:13:20,285 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2022-07-12 03:13:20,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:20,285 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-07-12 03:13:20,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:20,285 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-07-12 03:13:20,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 03:13:20,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:20,286 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:20,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:20,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:20,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:20,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:20,496 INFO L85 PathProgramCache]: Analyzing trace with hash 879764433, now seen corresponding path program 1 times [2022-07-12 03:13:20,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:20,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [237110978] [2022-07-12 03:13:20,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:20,497 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:20,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:20,499 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:20,501 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-12 03:13:20,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:20,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:13:20,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:20,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:20,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:20,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:20,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [237110978] [2022-07-12 03:13:20,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [237110978] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:20,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:20,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:13:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [976746564] [2022-07-12 03:13:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:20,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:13:20,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:20,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:13:20,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:13:20,612 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:20,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:20,658 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2022-07-12 03:13:20,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:13:20,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 03:13:20,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:20,660 INFO L225 Difference]: With dead ends: 46 [2022-07-12 03:13:20,660 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:13:20,660 INFO L412 NwaCegarLoop]: 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 [2022-07-12 03:13:20,661 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 33 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:20,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 52 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:13:20,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:13:20,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 22. [2022-07-12 03:13:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2022-07-12 03:13:20,665 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 16 [2022-07-12 03:13:20,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:20,666 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2022-07-12 03:13:20,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:20,666 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2022-07-12 03:13:20,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:13:20,666 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:20,667 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:20,692 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:20,888 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:20,889 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:20,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:20,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1572128049, now seen corresponding path program 1 times [2022-07-12 03:13:20,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:20,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1426538790] [2022-07-12 03:13:20,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:20,890 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:20,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:20,892 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:20,893 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-12 03:13:20,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:20,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:13:20,975 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:21,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:21,044 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:21,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:21,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1426538790] [2022-07-12 03:13:21,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1426538790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:21,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:21,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:13:21,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425016355] [2022-07-12 03:13:21,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:21,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:13:21,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:21,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:13:21,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:13:21,047 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:21,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:21,077 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-12 03:13:21,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 03:13:21,077 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:13:21,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:21,078 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:13:21,078 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:13:21,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:13:21,079 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:21,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 5 Unchecked, 0.0s Time] [2022-07-12 03:13:21,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:13:21,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:13:21,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0476190476190477) internal successors, (22), 21 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:21,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-07-12 03:13:21,082 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 17 [2022-07-12 03:13:21,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:21,082 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-07-12 03:13:21,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:21,082 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-07-12 03:13:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:13:21,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:21,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:21,099 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:21,292 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:21,293 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:21,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:21,294 INFO L85 PathProgramCache]: Analyzing trace with hash 1913492621, now seen corresponding path program 1 times [2022-07-12 03:13:21,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:21,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2142355650] [2022-07-12 03:13:21,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:21,294 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:21,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:21,312 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:21,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-12 03:13:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:21,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 16 conjunts are in the unsatisfiable core [2022-07-12 03:13:21,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:21,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:13:21,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2022-07-12 03:13:21,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:21,526 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:21,526 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:21,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2142355650] [2022-07-12 03:13:21,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2142355650] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:21,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:21,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:13:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142356726] [2022-07-12 03:13:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 03:13:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:21,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 03:13:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 03:13:21,528 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:21,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:21,567 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-07-12 03:13:21,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:13:21,567 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 03:13:21,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:21,568 INFO L225 Difference]: With dead ends: 25 [2022-07-12 03:13:21,568 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:13:21,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:13:21,569 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 23 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:21,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 39 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 10 Unchecked, 0.0s Time] [2022-07-12 03:13:21,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:13:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:13:21,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.0) internal successors, (21), 21 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:21,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-07-12 03:13:21,571 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2022-07-12 03:13:21,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:21,571 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-07-12 03:13:21,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:21,572 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-07-12 03:13:21,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:13:21,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:13:21,572 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:21,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:21,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:21,804 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:13:21,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:13:21,831 INFO L85 PathProgramCache]: Analyzing trace with hash 805440418, now seen corresponding path program 1 times [2022-07-12 03:13:21,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:13:21,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466413008] [2022-07-12 03:13:21,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:13:21,832 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:13:21,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:13:21,834 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-12 03:13:21,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-12 03:13:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:13:21,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 25 conjunts are in the unsatisfiable core [2022-07-12 03:13:21,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:13:22,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 03:13:22,170 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-12 03:13:22,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 24 [2022-07-12 03:13:22,429 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-12 03:13:22,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 28 [2022-07-12 03:13:22,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 03:13:22,600 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:13:22,600 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:13:22,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466413008] [2022-07-12 03:13:22,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466413008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:13:22,600 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:13:22,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-12 03:13:22,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236129264] [2022-07-12 03:13:22,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:13:22,601 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-12 03:13:22,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:13:22,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-12 03:13:22,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-12 03:13:22,601 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:22,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:13:22,692 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-07-12 03:13:22,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 03:13:22,692 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-12 03:13:22,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:13:22,692 INFO L225 Difference]: With dead ends: 22 [2022-07-12 03:13:22,692 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:13:22,693 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-12 03:13:22,693 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 5 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:13:22,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 27 Unchecked, 0.0s Time] [2022-07-12 03:13:22,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:13:22,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:13:22,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:22,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:13:22,694 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-07-12 03:13:22,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:13:22,694 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:13:22,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 03:13:22,694 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:13:22,694 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:13:22,696 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:13:22,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-12 03:13:22,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-12 03:13:22,908 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:13:23,080 INFO L899 garLoopResultBuilder]: For program point L27(lines 27 33) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point L36(lines 36 37) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point L28(lines 28 32) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point L61-1(lines 61 65) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L895 garLoopResultBuilder]: At program point L61-2(lines 61 65) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) |ULTIMATE.start_main_#t~short9#1| (exists ((|v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17|) (_ bv0 32))) (.cse1 (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (_ +zero 8 24)) (= .cse0 .cse1) (= (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) |ULTIMATE.start___signbit_float_~x#1|)))) (= currentRoundingMode roundNearestTiesToEven) (= (_ +zero 8 24) |ULTIMATE.start_ceil_float_#res#1|)) [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point L61-3(lines 61 65) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 83) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point L82(line 82) no Hoare annotation was computed. [2022-07-12 03:13:23,081 INFO L899 garLoopResultBuilder]: For program point L82-2(lines 82 85) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L45(lines 45 48) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L25(lines 25 49) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L902 garLoopResultBuilder]: At program point L87(lines 70 88) the Hoare annotation is: true [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L83(line 83) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L50(lines 50 54) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L50-1(lines 15 56) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L50-2(lines 50 54) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L38(lines 38 42) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L895 garLoopResultBuilder]: At program point L67(lines 58 68) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (= (_ +zero 8 24) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) |ULTIMATE.start_main_#t~short9#1| (= currentRoundingMode roundNearestTiesToEven) (= (_ +zero 8 24) |ULTIMATE.start_ceil_float_#res#1|)) [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L30(lines 30 32) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L26(lines 26 43) no Hoare annotation was computed. [2022-07-12 03:13:23,082 INFO L895 garLoopResultBuilder]: At program point L55(lines 15 56) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_ceil_float_~x#1|) (exists ((|v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17|) (_ bv0 32))) (.cse1 (select (select |#memory_int| |v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) (_ +zero 8 24)) (= .cse0 .cse1) (= (fp ((_ extract 31 31) .cse1) ((_ extract 30 23) .cse1) ((_ extract 22 0) .cse1)) |ULTIMATE.start_ceil_float_#res#1|)))) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:13:23,082 INFO L899 garLoopResultBuilder]: For program point L18-1(lines 18 22) no Hoare annotation was computed. [2022-07-12 03:13:23,083 INFO L895 garLoopResultBuilder]: At program point L18-2(lines 18 22) the Hoare annotation is: (and (= (_ +zero 8 24) |ULTIMATE.start_ceil_float_~x#1|) (= ~huge_ceil~0 ((_ to_fp 8 24) currentRoundingMode ((_ to_fp 11 53) currentRoundingMode 1000000000000000000000000000000.0))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:13:23,083 INFO L899 garLoopResultBuilder]: For program point L18-3(lines 18 22) no Hoare annotation was computed. [2022-07-12 03:13:23,083 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 40) no Hoare annotation was computed. [2022-07-12 03:13:23,083 INFO L899 garLoopResultBuilder]: For program point L39-2(lines 39 40) no Hoare annotation was computed. [2022-07-12 03:13:23,085 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:13:23,086 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:13:23,092 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,097 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,098 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,098 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,101 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,102 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,103 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,104 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,105 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,105 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,106 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,108 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,109 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,109 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,117 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,118 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,118 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:13:23 BoogieIcfgContainer [2022-07-12 03:13:23,124 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:13:23,124 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:13:23,124 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:13:23,125 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:13:23,125 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:13:18" (3/4) ... [2022-07-12 03:13:23,127 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:13:23,137 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2022-07-12 03:13:23,138 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2022-07-12 03:13:23,138 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:13:23,138 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:13:23,156 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((~Pluszero~LONGDOUBLE() == x && (\exists v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17 : bv32, v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][22:0]) == \result)) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-12 03:13:23,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((~Pluszero~LONGDOUBLE() == x && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && (\exists v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17 : bv32, v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][22:0]) == x)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~Pluszero~LONGDOUBLE() == \result [2022-07-12 03:13:23,157 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\result == 0bv32 && ~Pluszero~LONGDOUBLE() == x) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~Pluszero~LONGDOUBLE() == \result [2022-07-12 03:13:23,172 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:13:23,172 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:13:23,173 INFO L158 Benchmark]: Toolchain (without parser) took 5637.77ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 104.1MB in the beginning and 113.7MB in the end (delta: -9.6MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2022-07-12 03:13:23,173 INFO L158 Benchmark]: CDTParser took 12.61ms. Allocated memory is still 41.9MB. Free memory was 23.8MB in the beginning and 23.8MB in the end (delta: 61.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:13:23,173 INFO L158 Benchmark]: CACSL2BoogieTranslator took 259.47ms. Allocated memory is still 121.6MB. Free memory was 103.7MB in the beginning and 103.1MB in the end (delta: 622.6kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:13:23,173 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.50ms. Allocated memory is still 121.6MB. Free memory was 103.1MB in the beginning and 101.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:13:23,174 INFO L158 Benchmark]: Boogie Preprocessor took 42.36ms. Allocated memory is still 121.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:13:23,174 INFO L158 Benchmark]: RCFGBuilder took 580.85ms. Allocated memory is still 121.6MB. Free memory was 99.8MB in the beginning and 87.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-12 03:13:23,174 INFO L158 Benchmark]: TraceAbstraction took 4656.01ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 87.2MB in the beginning and 116.9MB in the end (delta: -29.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-07-12 03:13:23,175 INFO L158 Benchmark]: Witness Printer took 48.03ms. Allocated memory is still 159.4MB. Free memory was 116.9MB in the beginning and 113.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:13:23,176 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 12.61ms. Allocated memory is still 41.9MB. Free memory was 23.8MB in the beginning and 23.8MB in the end (delta: 61.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 259.47ms. Allocated memory is still 121.6MB. Free memory was 103.7MB in the beginning and 103.1MB in the end (delta: 622.6kB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.50ms. Allocated memory is still 121.6MB. Free memory was 103.1MB in the beginning and 101.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.36ms. Allocated memory is still 121.6MB. Free memory was 101.2MB in the beginning and 99.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 580.85ms. Allocated memory is still 121.6MB. Free memory was 99.8MB in the beginning and 87.5MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4656.01ms. Allocated memory was 121.6MB in the beginning and 159.4MB in the end (delta: 37.7MB). Free memory was 87.2MB in the beginning and 116.9MB in the end (delta: -29.7MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Witness Printer took 48.03ms. Allocated memory is still 159.4MB. Free memory was 116.9MB in the beginning and 113.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 83]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 100 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 100 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 69 IncrementalHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 182 mSDtfsCounter, 69 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=0, InterpolantAutomatonStates: 46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 12 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 10 NumberOfFragments, 178 HoareAnnotationTreeSize, 5 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 78 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 111 ConstructedInterpolants, 31 QuantifiedInterpolants, 1231 SizeOfPredicates, 50 NumberOfNonLiveVariables, 418 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 58]: Loop Invariant [2022-07-12 03:13:23,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((\result == 0bv32 && ~Pluszero~LONGDOUBLE() == x) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 18]: Loop Invariant [2022-07-12 03:13:23,182 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~Pluszero~LONGDOUBLE() == x && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 70]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 61]: Loop Invariant [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,183 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,184 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((((~Pluszero~LONGDOUBLE() == x && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && aux-res == 0.0f && __signbit_float(res) == 0-aux) && (\exists v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17 : bv32, v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][22:0]) == x)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 15]: Loop Invariant [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,185 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,186 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,187 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11,QUANTIFIED] [2022-07-12 03:13:23,187 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((~Pluszero~LONGDOUBLE() == x && (\exists v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17 : bv32, v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11 : bv32 :: (~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32][22:0]) == ~Pluszero~LONGDOUBLE() && unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#gf_u~0#1.base_17][0bv32] == unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32]) && ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start_ceil_float_~#sf_u~0#1.base_11][0bv32][22:0]) == \result)) && huge_ceil == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0E30))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven RESULT: Ultimate proved your program to be correct! [2022-07-12 03:13:23,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE