./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/double_req_bl_0930.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/double_req_bl_0930.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 8d734d3869a39929ea479cab14eb5865c36aeb805da0fe481c4349ce6c2b3759 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:00:55,259 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:00:55,260 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:00:55,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:00:55,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:00:55,296 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:00:55,297 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:00:55,299 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:00:55,300 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:00:55,303 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:00:55,304 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:00:55,305 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:00:55,306 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:00:55,307 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:00:55,308 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:00:55,310 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:00:55,311 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:00:55,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:00:55,313 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:00:55,317 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:00:55,318 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:00:55,319 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:00:55,319 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:00:55,320 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:00:55,321 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:00:55,326 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:00:55,326 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:00:55,326 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:00:55,327 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:00:55,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:00:55,328 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:00:55,328 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:00:55,329 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:00:55,330 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:00:55,330 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:00:55,331 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:00:55,332 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:00:55,332 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:00:55,332 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:00:55,332 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:00:55,333 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:00:55,334 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:00:55,335 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:00:55,356 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:00:55,356 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:00:55,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:00:55,357 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:00:55,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:00:55,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:00:55,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:00:55,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:00:55,359 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:00:55,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:00:55,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:00:55,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 03:00:55,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:00:55,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:00:55,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:00:55,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:00:55,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:00:55,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:00:55,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:00:55,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:00:55,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:00:55,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:00:55,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:00:55,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:00:55,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:00:55,362 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:00:55,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:00:55,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:00:55,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 03:00:55,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 03:00:55,363 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:00:55,363 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:00:55,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:00:55,364 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 -> 8d734d3869a39929ea479cab14eb5865c36aeb805da0fe481c4349ce6c2b3759 [2022-07-12 03:00:55,533 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:00:55,545 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:00:55,548 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:00:55,548 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:00:55,549 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:00:55,550 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0930.c [2022-07-12 03:00:55,603 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e004b049b/cdd06de97bd646299e66a9976bac4d37/FLAG4f86ddb67 [2022-07-12 03:00:55,893 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:00:55,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0930.c [2022-07-12 03:00:55,899 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e004b049b/cdd06de97bd646299e66a9976bac4d37/FLAG4f86ddb67 [2022-07-12 03:00:56,333 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e004b049b/cdd06de97bd646299e66a9976bac4d37 [2022-07-12 03:00:56,335 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:00:56,336 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:00:56,348 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:00:56,348 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:00:56,351 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:00:56,352 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,353 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24ebe5cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56, skipping insertion in model container [2022-07-12 03:00:56,353 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,359 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:00:56,379 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:00:56,516 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/double_req_bl_0930.c[3808,3821] [2022-07-12 03:00:56,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:00:56,523 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:00:56,555 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/double_req_bl_0930.c[3808,3821] [2022-07-12 03:00:56,556 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:00:56,565 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:00:56,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56 WrapperNode [2022-07-12 03:00:56,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:00:56,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:00:56,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:00:56,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:00:56,572 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:00:56" (1/1) ... [2022-07-12 03:00:56,591 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:00:56" (1/1) ... [2022-07-12 03:00:56,610 INFO L137 Inliner]: procedures = 18, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 174 [2022-07-12 03:00:56,610 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:00:56,617 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:00:56,617 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:00:56,618 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:00:56,623 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,625 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,626 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,631 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,635 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:00:56,638 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:00:56,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:00:56,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:00:56,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (1/1) ... [2022-07-12 03:00:56,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:00:56,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:00:56,667 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:00:56,669 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:00:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:00:56,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 03:00:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:00:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-12 03:00:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 03:00:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-12 03:00:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:00:56,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:00:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 03:00:56,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:00:56,749 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:00:56,750 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:00:56,915 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:00:56,919 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:00:56,920 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-12 03:00:56,921 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:00:56 BoogieIcfgContainer [2022-07-12 03:00:56,921 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:00:56,923 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:00:56,923 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:00:56,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:00:56,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:00:56" (1/3) ... [2022-07-12 03:00:56,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdd2b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:00:56, skipping insertion in model container [2022-07-12 03:00:56,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:00:56" (2/3) ... [2022-07-12 03:00:56,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bdd2b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:00:56, skipping insertion in model container [2022-07-12 03:00:56,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:00:56" (3/3) ... [2022-07-12 03:00:56,927 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0930.c [2022-07-12 03:00:56,936 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:00:56,937 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:00:56,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:00:56,972 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@54326bb5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@66ee2367 [2022-07-12 03:00:56,973 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:00:56,976 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 36 states have internal predecessors, (61), 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:00:57,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:00:57,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:00:57,005 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:00:57,006 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:00:57,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:00:57,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1030829373, now seen corresponding path program 1 times [2022-07-12 03:00:57,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:00:57,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390612355] [2022-07-12 03:00:57,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:00:57,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:00:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:00:57,142 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:00:57,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 03:00:57,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390612355] [2022-07-12 03:00:57,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390612355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:00:57,145 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:00:57,145 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:00:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391626296] [2022-07-12 03:00:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:00:57,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:00:57,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 03:00:57,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:00:57,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:00:57,194 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.7428571428571429) internal successors, (61), 36 states have internal predecessors, (61), 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:00:57,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:00:57,213 INFO L93 Difference]: Finished difference Result 72 states and 120 transitions. [2022-07-12 03:00:57,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:00:57,215 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:00:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:00:57,223 INFO L225 Difference]: With dead ends: 72 [2022-07-12 03:00:57,224 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:00:57,227 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:00:57,230 INFO L413 NwaCegarLoop]: 50 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, 50 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:00:57,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:00:57,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:00:57,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 03:00:57,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.4242424242424243) internal successors, (47), 33 states have internal predecessors, (47), 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:00:57,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2022-07-12 03:00:57,262 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 47 transitions. Word has length 10 [2022-07-12 03:00:57,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:00:57,262 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 47 transitions. [2022-07-12 03:00:57,263 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:00:57,263 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 47 transitions. [2022-07-12 03:00:57,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:00:57,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:00:57,264 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:00:57,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 03:00:57,265 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:00:57,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:00:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -1304477824, now seen corresponding path program 1 times [2022-07-12 03:00:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 03:00:57,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625427983] [2022-07-12 03:00:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:00:57,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 03:00:57,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:00:57,338 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-12 03:00:57,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-12 03:00:57,390 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-12 03:00:57,390 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-12 03:00:57,394 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:00:57,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 03:00:57,399 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-12 03:00:57,401 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:00:57,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:00:57 BoogieIcfgContainer [2022-07-12 03:00:57,439 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:00:57,441 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:00:57,441 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:00:57,441 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:00:57,442 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:00:56" (3/4) ... [2022-07-12 03:00:57,444 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-12 03:00:57,444 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:00:57,445 INFO L158 Benchmark]: Toolchain (without parser) took 1108.58ms. Allocated memory is still 100.7MB. Free memory was 68.1MB in the beginning and 62.2MB in the end (delta: 5.9MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-07-12 03:00:57,446 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 81.8MB. Free memory was 51.2MB in the beginning and 51.2MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:00:57,447 INFO L158 Benchmark]: CACSL2BoogieTranslator took 218.53ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 73.8MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-12 03:00:57,449 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.62ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 71.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:00:57,449 INFO L158 Benchmark]: Boogie Preprocessor took 19.67ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 69.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:00:57,451 INFO L158 Benchmark]: RCFGBuilder took 283.66ms. Allocated memory is still 100.7MB. Free memory was 69.6MB in the beginning and 54.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-12 03:00:57,451 INFO L158 Benchmark]: TraceAbstraction took 516.72ms. Allocated memory is still 100.7MB. Free memory was 53.9MB in the beginning and 62.2MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:00:57,451 INFO L158 Benchmark]: Witness Printer took 3.47ms. Allocated memory is still 100.7MB. Free memory is still 62.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:00:57,455 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.15ms. Allocated memory is still 81.8MB. Free memory was 51.2MB in the beginning and 51.2MB in the end (delta: 18.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 218.53ms. Allocated memory is still 100.7MB. Free memory was 68.0MB in the beginning and 73.8MB in the end (delta: -5.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.62ms. Allocated memory is still 100.7MB. Free memory was 73.8MB in the beginning and 71.6MB in the end (delta: 2.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.67ms. Allocated memory is still 100.7MB. Free memory was 71.6MB in the beginning and 69.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 283.66ms. Allocated memory is still 100.7MB. Free memory was 69.6MB in the beginning and 54.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 516.72ms. Allocated memory is still 100.7MB. Free memory was 53.9MB in the beginning and 62.2MB in the end (delta: -8.3MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.47ms. Allocated memory is still 100.7MB. Free memory is still 62.2MB. 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: 152]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseOr at line 61, overapproximation of someBinaryArithmeticDOUBLEoperation at line 62, overapproximation of bitwiseAnd at line 61, overapproximation of someBinaryDOUBLEComparisonOperation at line 151. Possible FailurePath: [L34-L43] static const double ln2_hi_log = 6.93147180369123816490e-01, ln2_lo_log = 1.90821492927058770002e-10, two54_log = 1.80143985094819840000e+16, Lg1_log = 6.666666666666735130e-01, Lg2_log = 3.999999999940941908e-01, Lg3_log = 2.857142874366239149e-01, Lg4_log = 2.222219843214978396e-01, Lg5_log = 1.818357216161805012e-01, Lg6_log = 1.531383769920937332e-01, Lg7_log = 1.479819860511658591e-01; [L45] static const double zero = 0.0; VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, zero=0] [L146] double x = 1.0; [L148] CALL, EXPR __ieee754_log(x) [L48] double hfsq, f, s, z, R, w, t1, t2, dk; [L49] __int32_t k, hx, i, j; [L50] __uint32_t lx; VAL [\old(x)=1, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, two54_log=18014398509481984, x=1, zero=0] [L53] ieee_double_shape_type ew_u; [L54] ew_u.value = (x) [L55] EXPR ew_u.parts.msw [L55] (hx) = ew_u.parts.msw [L56] EXPR ew_u.parts.lsw [L56] (lx) = ew_u.parts.lsw [L59] k = 0 VAL [\old(x)=1, hx=6, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=1, zero=0] [L60] COND TRUE hx < 0x00100000 VAL [\old(x)=1, hx=6, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=1, zero=0] [L61] COND TRUE ((hx & 0x7fffffff) | lx) == 0 [L62] return -two54_log / zero; VAL [\old(x)=1, hx=6, k=0, Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, lx=0, two54_log=18014398509481984, x=1, zero=0] [L148] RET, EXPR __ieee754_log(x) [L148] double res = __ieee754_log(x); [L151] EXPR res == 0.0 && __signbit_double(res) == 0 VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, res=18014398509481985, res == 0.0 && __signbit_double(res) == 0=0, two54_log=18014398509481984, x=1, zero=0] [L151] COND TRUE !(res == 0.0 && __signbit_double(res) == 0) [L152] reach_error() VAL [Lg1_log=666666666666673513/1000000000000000000, Lg2_log=999999999985235477/2500000000000000000, Lg3_log=2857142874366239149/10000000000000000000, Lg4_log=555554960803744599/2500000000000000000, Lg5_log=454589304040451253/2500000000000000000, Lg6_log=382845942480234333/2500000000000000000, Lg7_log=1479819860511658591/10000000000000000000, ln2_hi_log=69314718036912381649/100000000000000000000, ln2_lo_log=95410746463529385001/500000000000000000000000000000, res=18014398509481985, two54_log=18014398509481984, x=1, zero=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.4s, 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, 50 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, 50 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=37occurred 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.1s 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:00:57,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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/double_req_bl_0930.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 8d734d3869a39929ea479cab14eb5865c36aeb805da0fe481c4349ce6c2b3759 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 03:00:59,217 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 03:00:59,219 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 03:00:59,249 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 03:00:59,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 03:00:59,250 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 03:00:59,253 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 03:00:59,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 03:00:59,257 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 03:00:59,260 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 03:00:59,261 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 03:00:59,264 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 03:00:59,265 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 03:00:59,266 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 03:00:59,267 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 03:00:59,270 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 03:00:59,271 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 03:00:59,271 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 03:00:59,273 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 03:00:59,274 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 03:00:59,278 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 03:00:59,278 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 03:00:59,279 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 03:00:59,280 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 03:00:59,281 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 03:00:59,283 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 03:00:59,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 03:00:59,285 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 03:00:59,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 03:00:59,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 03:00:59,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 03:00:59,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 03:00:59,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 03:00:59,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 03:00:59,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 03:00:59,290 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 03:00:59,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 03:00:59,291 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 03:00:59,291 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 03:00:59,291 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 03:00:59,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 03:00:59,293 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 03:00:59,296 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:00:59,317 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 03:00:59,317 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 03:00:59,317 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 03:00:59,317 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 03:00:59,318 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 03:00:59,318 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 03:00:59,319 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 03:00:59,319 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 03:00:59,319 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 03:00:59,320 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 03:00:59,320 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 03:00:59,320 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 03:00:59,320 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 03:00:59,321 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 03:00:59,321 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 03:00:59,321 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 03:00:59,321 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 03:00:59,321 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-12 03:00:59,321 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-12 03:00:59,322 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 03:00:59,322 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 03:00:59,322 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 03:00:59,322 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 03:00:59,322 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 03:00:59,322 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 03:00:59,322 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 03:00:59,323 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:00:59,323 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 03:00:59,323 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 03:00:59,323 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 03:00:59,323 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-12 03:00:59,324 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-12 03:00:59,324 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 03:00:59,324 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 03:00:59,324 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 03:00:59,324 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-12 03:00:59,324 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 -> 8d734d3869a39929ea479cab14eb5865c36aeb805da0fe481c4349ce6c2b3759 [2022-07-12 03:00:59,580 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 03:00:59,601 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 03:00:59,603 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 03:00:59,604 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 03:00:59,604 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 03:00:59,606 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/double_req_bl_0930.c [2022-07-12 03:00:59,649 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4542926c3/48a105f528ed4df1a27a1ec0367f9811/FLAG6946b93cd [2022-07-12 03:01:00,021 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 03:01:00,022 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/double_req_bl_0930.c [2022-07-12 03:01:00,028 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4542926c3/48a105f528ed4df1a27a1ec0367f9811/FLAG6946b93cd [2022-07-12 03:01:00,431 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4542926c3/48a105f528ed4df1a27a1ec0367f9811 [2022-07-12 03:01:00,433 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 03:01:00,434 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 03:01:00,435 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 03:01:00,435 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 03:01:00,440 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 03:01:00,441 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,442 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@25b72b94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00, skipping insertion in model container [2022-07-12 03:01:00,443 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,449 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 03:01:00,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 03:01:00,608 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/double_req_bl_0930.c[3808,3821] [2022-07-12 03:01:00,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:01:00,661 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 03:01:00,701 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/double_req_bl_0930.c[3808,3821] [2022-07-12 03:01:00,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 03:01:00,713 INFO L208 MainTranslator]: Completed translation [2022-07-12 03:01:00,713 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00 WrapperNode [2022-07-12 03:01:00,713 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 03:01:00,714 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 03:01:00,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 03:01:00,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 03:01:00,720 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:01:00" (1/1) ... [2022-07-12 03:01:00,737 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:01:00" (1/1) ... [2022-07-12 03:01:00,760 INFO L137 Inliner]: procedures = 21, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 162 [2022-07-12 03:01:00,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 03:01:00,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 03:01:00,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 03:01:00,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 03:01:00,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,800 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,805 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,811 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 03:01:00,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 03:01:00,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 03:01:00,816 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 03:01:00,817 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (1/1) ... [2022-07-12 03:01:00,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 03:01:00,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 03:01:00,840 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:01:00,854 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:01:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 03:01:00,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8 [2022-07-12 03:01:00,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8 [2022-07-12 03:01:00,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-12 03:01:00,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 03:01:00,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-12 03:01:00,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 03:01:00,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 03:01:00,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-12 03:01:00,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 03:01:00,978 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 03:01:00,980 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 03:01:24,064 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 03:01:24,068 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 03:01:24,069 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-12 03:01:24,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:01:24 BoogieIcfgContainer [2022-07-12 03:01:24,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 03:01:24,082 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 03:01:24,082 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 03:01:24,084 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 03:01:24,092 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 03:01:00" (1/3) ... [2022-07-12 03:01:24,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c78fd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:01:24, skipping insertion in model container [2022-07-12 03:01:24,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 03:01:00" (2/3) ... [2022-07-12 03:01:24,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c78fd11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 03:01:24, skipping insertion in model container [2022-07-12 03:01:24,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:01:24" (3/3) ... [2022-07-12 03:01:24,094 INFO L111 eAbstractionObserver]: Analyzing ICFG double_req_bl_0930.c [2022-07-12 03:01:24,105 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 03:01:24,105 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-12 03:01:24,164 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 03:01:24,171 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@2071ec79, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6c5912a9 [2022-07-12 03:01:24,171 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-12 03:01:24,176 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 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:01:24,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 03:01:24,183 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:01:24,183 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:01:24,184 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:01:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:01:24,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1030213693, now seen corresponding path program 1 times [2022-07-12 03:01:24,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:01:24,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [284871335] [2022-07-12 03:01:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:01:24,198 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:01:24,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:01:24,200 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:01:24,201 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:01:24,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:01:24,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-12 03:01:24,886 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:01:24,898 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:01:24,898 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:01:24,898 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:01:24,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [284871335] [2022-07-12 03:01:24,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [284871335] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:01:24,899 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:01:24,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 03:01:24,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861225332] [2022-07-12 03:01:24,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:01:24,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-12 03:01:24,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:01:24,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-12 03:01:24,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-12 03:01:24,926 INFO L87 Difference]: Start difference. First operand has 33 states, 31 states have (on average 1.7096774193548387) internal successors, (53), 32 states have internal predecessors, (53), 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:01:24,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:01:24,943 INFO L93 Difference]: Finished difference Result 64 states and 104 transitions. [2022-07-12 03:01:24,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-12 03:01:24,949 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:01:24,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:01:24,955 INFO L225 Difference]: With dead ends: 64 [2022-07-12 03:01:24,955 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 03:01:24,958 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:01:24,961 INFO L413 NwaCegarLoop]: 44 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, 44 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:01:24,962 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 03:01:24,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 03:01:24,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 03:01:24,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.4137931034482758) internal successors, (41), 29 states have internal predecessors, (41), 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:01:24,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 41 transitions. [2022-07-12 03:01:24,992 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 41 transitions. Word has length 10 [2022-07-12 03:01:24,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:01:24,993 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 41 transitions. [2022-07-12 03:01:24,993 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:01:24,994 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 41 transitions. [2022-07-12 03:01:24,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:01:24,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:01:24,995 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:01:25,020 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:01:25,199 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:01:25,200 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:01:25,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:01:25,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1305093504, now seen corresponding path program 1 times [2022-07-12 03:01:25,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:01:25,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1610435976] [2022-07-12 03:01:25,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:01:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:01:25,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:01:25,203 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:01:25,204 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:01:25,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:01:25,898 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:01:25,900 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:01:26,564 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:01:26,565 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:01:26,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:01:26,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1610435976] [2022-07-12 03:01:26,566 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1610435976] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:01:26,566 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:01:26,566 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:01:26,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801427884] [2022-07-12 03:01:26,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:01:26,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:01:26,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:01:26,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:01:26,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:01:26,572 INFO L87 Difference]: Start difference. First operand 30 states and 41 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:01:26,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:01:26,577 INFO L93 Difference]: Finished difference Result 50 states and 69 transitions. [2022-07-12 03:01:26,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:01:26,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:01:26,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:01:26,578 INFO L225 Difference]: With dead ends: 50 [2022-07-12 03:01:26,578 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:01:26,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:01:26,580 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 0 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:01:26,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 84 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-07-12 03:01:26,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:01:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:01:26,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 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:01:26,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-07-12 03:01:26,583 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 11 [2022-07-12 03:01:26,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:01:26,583 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-07-12 03:01:26,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:01:26,584 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-07-12 03:01:26,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 03:01:26,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:01:26,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:01:26,606 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:01:26,803 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:01:26,804 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:01:26,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:01:26,805 INFO L85 PathProgramCache]: Analyzing trace with hash -594905855, now seen corresponding path program 1 times [2022-07-12 03:01:26,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:01:26,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [44236912] [2022-07-12 03:01:26,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:01:26,806 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:01:26,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:01:26,807 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:01:26,809 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:01:26,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:01:26,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-12 03:01:26,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:01:27,624 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:01:27,624 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:01:27,624 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:01:27,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [44236912] [2022-07-12 03:01:27,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [44236912] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:01:27,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:01:27,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:01:27,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239336755] [2022-07-12 03:01:27,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:01:27,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 03:01:27,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:01:27,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 03:01:27,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:01:27,626 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:01:27,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:01:27,629 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-12 03:01:27,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 03:01:27,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:01:27,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:01:27,630 INFO L225 Difference]: With dead ends: 35 [2022-07-12 03:01:27,630 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 03:01:27,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 03:01:27,631 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 9 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:01:27,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 9 Unchecked, 0.0s Time] [2022-07-12 03:01:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 03:01:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 03:01:27,634 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:01:27,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 33 transitions. [2022-07-12 03:01:27,634 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 33 transitions. Word has length 11 [2022-07-12 03:01:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:01:27,635 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 33 transitions. [2022-07-12 03:01:27,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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:01:27,635 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 33 transitions. [2022-07-12 03:01:27,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:01:27,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:01:27,635 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:01:27,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-12 03:01:27,839 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:01:27,840 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:01:27,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:01:27,840 INFO L85 PathProgramCache]: Analyzing trace with hash 464469069, now seen corresponding path program 1 times [2022-07-12 03:01:27,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:01:27,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754121536] [2022-07-12 03:01:27,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:01:27,841 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:01:27,842 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:01:27,842 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:01:27,844 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:01:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:01:27,970 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-12 03:01:27,971 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:01:29,045 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:01:29,045 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:01:29,045 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:01:29,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754121536] [2022-07-12 03:01:29,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754121536] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:01:29,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:01:29,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 03:01:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [612397327] [2022-07-12 03:01:29,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:01:29,046 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:01:29,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:01:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:01:29,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:01:29,047 INFO L87 Difference]: Start difference. First operand 26 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:01:31,391 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:01:33,966 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:01:36,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:01:38,708 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.28s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:01:41,145 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:01:43,657 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:01:45,931 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.27s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:01:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:01:46,670 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-07-12 03:01:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:01:46,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:01:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:01:46,672 INFO L225 Difference]: With dead ends: 47 [2022-07-12 03:01:46,672 INFO L226 Difference]: Without dead ends: 44 [2022-07-12 03:01:46,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:01:46,673 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 42 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:01:46,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 84 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 7 Unknown, 0 Unchecked, 17.0s Time] [2022-07-12 03:01:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-12 03:01:46,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-12 03:01:46,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 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:01:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-07-12 03:01:46,677 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 17 [2022-07-12 03:01:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:01:46,677 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-07-12 03:01:46,678 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 4 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:01:46,678 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-07-12 03:01:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:01:46,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:01:46,678 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:01:46,690 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:01:46,886 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:01:46,887 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:01:46,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:01:46,887 INFO L85 PathProgramCache]: Analyzing trace with hash 466316111, now seen corresponding path program 1 times [2022-07-12 03:01:46,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:01:46,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791021343] [2022-07-12 03:01:46,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:01:46,888 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:01:46,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:01:46,889 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:01:46,891 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:01:47,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:01:47,372 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 03:01:47,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:01:49,875 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:01:49,875 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:01:49,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:01:49,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [791021343] [2022-07-12 03:01:49,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [791021343] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:01:49,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:01:49,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 03:01:49,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556456272] [2022-07-12 03:01:49,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:01:49,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:01:49,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:01:49,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:01:49,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:01:49,876 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:01:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:01:49,880 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-07-12 03:01:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:01:49,880 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:01:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:01:49,880 INFO L225 Difference]: With dead ends: 37 [2022-07-12 03:01:49,880 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 03:01:49,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:01:49,883 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 3 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 23 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:01:49,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 96 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 23 Unchecked, 0.0s Time] [2022-07-12 03:01:49,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 03:01:49,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-07-12 03:01:49,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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:01:49,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-07-12 03:01:49,887 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2022-07-12 03:01:49,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:01:49,887 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-07-12 03:01:49,887 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 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:01:49,887 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-07-12 03:01:49,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:01:49,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:01:49,887 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:01:49,910 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:01:50,088 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:01:50,088 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:01:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:01:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash 671337773, now seen corresponding path program 1 times [2022-07-12 03:01:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:01:50,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1482721292] [2022-07-12 03:01:50,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:01:50,089 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:01:50,089 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:01:50,090 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:01:50,091 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:01:50,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:01:50,931 INFO L263 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 03:01:50,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:01:51,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 16 [2022-07-12 03:01:54,346 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 87 treesize of output 59 [2022-07-12 03:01:55,383 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:01:55,383 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:01:55,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:01:55,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1482721292] [2022-07-12 03:01:55,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1482721292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:01:55,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:01:55,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 03:01:55,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678411798] [2022-07-12 03:01:55,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:01:55,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 03:01:55,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:01:55,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 03:01:55,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-07-12 03:01:55,385 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) 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:01:59,444 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.52s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:02,183 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:04,197 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:06,431 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:08,458 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:10,882 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.42s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:12,893 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:15,407 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.51s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:17,410 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:19,696 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:21,699 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-12 03:02:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:02:21,700 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-07-12 03:02:21,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 03:02:21,768 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) 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:02:21,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:02:21,768 INFO L225 Difference]: With dead ends: 44 [2022-07-12 03:02:21,768 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 03:02:21,769 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-12 03:02:21,769 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 26 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 26.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:02:21,769 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 73 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 11 Unknown, 16 Unchecked, 26.0s Time] [2022-07-12 03:02:21,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 03:02:21,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-07-12 03:02:21,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 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:02:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-12 03:02:21,772 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 17 [2022-07-12 03:02:21,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:02:21,772 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-12 03:02:21,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) 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:02:21,773 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-12 03:02:21,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 03:02:21,773 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:02:21,773 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:02:21,797 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:02:21,977 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:02:21,978 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:02:21,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:02:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1125442114, now seen corresponding path program 1 times [2022-07-12 03:02:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:02:21,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [561076387] [2022-07-12 03:02:21,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:02:21,979 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:02:21,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:02:21,980 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:02:21,981 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:02:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:02:25,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-12 03:02:25,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:02:26,741 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:02:26,741 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:02:26,741 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:02:26,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [561076387] [2022-07-12 03:02:26,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [561076387] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:02:26,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:02:26,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 03:02:26,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091520709] [2022-07-12 03:02:26,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:02:26,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 03:02:26,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:02:26,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 03:02:26,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:02:26,743 INFO L87 Difference]: Start difference. First operand 27 states and 31 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:02:26,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:02:26,745 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-12 03:02:26,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 03:02:26,745 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:02:26,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:02:26,745 INFO L225 Difference]: With dead ends: 34 [2022-07-12 03:02:26,746 INFO L226 Difference]: Without dead ends: 22 [2022-07-12 03:02:26,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 03:02:26,746 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 03:02:26,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-07-12 03:02:26,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-07-12 03:02:26,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-07-12 03:02:26,758 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:02:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 21 transitions. [2022-07-12 03:02:26,758 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 21 transitions. Word has length 17 [2022-07-12 03:02:26,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:02:26,758 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 21 transitions. [2022-07-12 03:02:26,759 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:02:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 21 transitions. [2022-07-12 03:02:26,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 03:02:26,759 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 03:02:26,759 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:02:26,848 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:02:26,964 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:02:26,964 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-12 03:02:26,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 03:02:26,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1561479138, now seen corresponding path program 1 times [2022-07-12 03:02:26,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-12 03:02:26,965 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1381132360] [2022-07-12 03:02:26,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 03:02:26,965 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-12 03:02:26,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-12 03:02:26,966 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:02:26,967 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:02:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 03:02:27,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-12 03:02:27,116 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 03:02:30,390 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:02:30,390 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-12 03:02:30,390 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-12 03:02:30,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1381132360] [2022-07-12 03:02:30,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1381132360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 03:02:30,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 03:02:30,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 03:02:30,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603967193] [2022-07-12 03:02:30,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 03:02:30,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 03:02:30,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-12 03:02:30,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 03:02:30,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-12 03:02:30,391 INFO L87 Difference]: Start difference. First operand 22 states and 21 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:02:33,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 03:02:33,098 INFO L93 Difference]: Finished difference Result 22 states and 21 transitions. [2022-07-12 03:02:33,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 03:02:33,098 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:02:33,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 03:02:33,098 INFO L225 Difference]: With dead ends: 22 [2022-07-12 03:02:33,098 INFO L226 Difference]: Without dead ends: 0 [2022-07-12 03:02:33,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-07-12 03:02:33,099 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 18 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 6 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 03:02:33,099 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 6 Unchecked, 0.7s Time] [2022-07-12 03:02:33,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-12 03:02:33,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-12 03:02:33,100 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:02:33,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-12 03:02:33,100 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21 [2022-07-12 03:02:33,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 03:02:33,100 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-12 03:02:33,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 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:02:33,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-12 03:02:33,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-12 03:02:33,102 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-12 03:02:33,113 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-12 03:02:33,302 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:02:33,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-12 03:02:35,321 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 72) no Hoare annotation was computed. [2022-07-12 03:02:35,321 INFO L899 garLoopResultBuilder]: For program point L60-1(lines 47 126) no Hoare annotation was computed. [2022-07-12 03:02:35,321 INFO L899 garLoopResultBuilder]: For program point L151(line 151) no Hoare annotation was computed. [2022-07-12 03:02:35,321 INFO L899 garLoopResultBuilder]: For program point L151-2(lines 151 154) no Hoare annotation was computed. [2022-07-12 03:02:35,321 INFO L899 garLoopResultBuilder]: For program point L52-1(lines 52 57) no Hoare annotation was computed. [2022-07-12 03:02:35,321 INFO L895 garLoopResultBuilder]: At program point L52-2(lines 52 57) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode 1.0) |ULTIMATE.start___ieee754_log_~x#1|) (= (_ +zero 11 53) ~zero~0) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L52-3(lines 52 57) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L61(lines 61 62) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L152(line 152) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L86(lines 86 102) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L78-1(lines 78 83) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L895 garLoopResultBuilder]: At program point L78-2(lines 78 83) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13| (_ BitVec 32)) (|v_skolemized_q#valueAsBitvector_20| (_ BitVec 64))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13|) (_ bv4 32)))) (and (= (bvand .cse0 (_ bv1048575 32)) |ULTIMATE.start___ieee754_log_~hx~1#1|) (= (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_20|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_20|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_20|)) |ULTIMATE.start___ieee754_log_~x#1|) (= ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_20|) .cse0)))) (= ((_ to_fp 11 53) currentRoundingMode 1.0) |ULTIMATE.start___ieee754_log_~x#1|) (= (_ +zero 11 53) ~zero~0) (= currentRoundingMode roundNearestTiesToEven) (exists ((|v_skolemized_q#valueAsBitvector_17| (_ BitVec 64)) (currentRoundingMode RoundingMode)) (let ((.cse1 ((_ extract 63 32) |v_skolemized_q#valueAsBitvector_17|))) (and (= |ULTIMATE.start___ieee754_log_~i~0#1| (bvand (_ bv1048576 32) (bvadd (bvand .cse1 (_ bv1048575 32)) (_ bv614244 32)))) (= ((_ to_fp 11 53) currentRoundingMode 1.0) (fp ((_ extract 63 63) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 62 52) |v_skolemized_q#valueAsBitvector_17|) ((_ extract 51 0) |v_skolemized_q#valueAsBitvector_17|))) (= (bvadd (_ bv1023 32) |ULTIMATE.start___ieee754_log_~k~0#1|) (bvashr .cse1 (_ bv20 32))))))) [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L78-3(lines 78 83) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 94) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L895 garLoopResultBuilder]: At program point L137(lines 128 138) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short13#1| (= (_ bv0 32) |ULTIMATE.start___signbit_double_#res#1|)) [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L96(lines 96 101) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L63(lines 63 64) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L121(lines 121 124) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L88(lines 88 93) no Hoare annotation was computed. [2022-07-12 03:02:35,322 INFO L899 garLoopResultBuilder]: For program point L113(lines 113 125) no Hoare annotation was computed. [2022-07-12 03:02:35,323 INFO L899 garLoopResultBuilder]: For program point L131-1(lines 131 135) no Hoare annotation was computed. [2022-07-12 03:02:35,323 INFO L895 garLoopResultBuilder]: At program point L131-2(lines 131 135) the Hoare annotation is: (and |ULTIMATE.start_main_#t~short13#1| (= |ULTIMATE.start_main_~res~0#1| (_ +zero 11 53)) (= (_ +zero 11 53) ~zero~0) (= (_ +zero 11 53) |ULTIMATE.start___signbit_double_~x#1|) (= (_ +zero 11 53) |ULTIMATE.start___ieee754_log_#res#1|)) [2022-07-12 03:02:35,323 INFO L899 garLoopResultBuilder]: For program point L131-3(lines 131 135) no Hoare annotation was computed. [2022-07-12 03:02:35,323 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-12 03:02:35,323 INFO L902 garLoopResultBuilder]: At program point L156(lines 140 157) the Hoare annotation is: true [2022-07-12 03:02:35,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 152) no Hoare annotation was computed. [2022-07-12 03:02:35,323 INFO L899 garLoopResultBuilder]: For program point L115(lines 115 119) no Hoare annotation was computed. [2022-07-12 03:02:35,323 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-12 03:02:35,323 INFO L895 garLoopResultBuilder]: At program point L124(lines 47 126) the Hoare annotation is: (and (= ((_ to_fp 11 53) currentRoundingMode 1.0) |ULTIMATE.start___ieee754_log_~x#1|) (= (_ +zero 11 53) ~zero~0) (= currentRoundingMode roundNearestTiesToEven) (= (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (fp.sub roundNearestTiesToEven .cse0 .cse0)) |ULTIMATE.start___ieee754_log_~f~0#1|) (= (_ +zero 11 53) |ULTIMATE.start___ieee754_log_#res#1|)) [2022-07-12 03:02:35,324 INFO L899 garLoopResultBuilder]: For program point L67-1(lines 67 71) no Hoare annotation was computed. [2022-07-12 03:02:35,324 INFO L895 garLoopResultBuilder]: At program point L67-2(lines 67 71) the Hoare annotation is: false [2022-07-12 03:02:35,326 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 03:02:35,327 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-12 03:02:35,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,336 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:02:35,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,339 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:02:35,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,341 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,343 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,344 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,344 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.07 03:02:35 BoogieIcfgContainer [2022-07-12 03:02:35,344 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-12 03:02:35,345 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-12 03:02:35,345 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-12 03:02:35,345 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-12 03:02:35,345 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 03:01:24" (3/4) ... [2022-07-12 03:02:35,347 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-12 03:02:35,354 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-12 03:02:35,355 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-12 03:02:35,355 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-12 03:02:35,355 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-12 03:02:35,370 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) == x && ~Pluszero~LONGDOUBLE() == zero) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)) == f) && ~Pluszero~LONGDOUBLE() == \result [2022-07-12 03:02:35,370 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((\exists v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13 : bv32, v_skolemized_q#valueAsBitvector_20 : bv64 :: (~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13][4bv32], 1048575bv32) == hx && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_20[63:63], v_skolemized_q#valueAsBitvector_20[62:52], v_skolemized_q#valueAsBitvector_20[51:0]) == x) && v_skolemized_q#valueAsBitvector_20[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13][4bv32]) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_skolemized_q#valueAsBitvector_17 : bv64, currentRoundingMode : FloatRoundingMode :: (i == ~bvand32(1048576bv32, ~bvadd64(~bvand32(v_skolemized_q#valueAsBitvector_17[63:32], 1048575bv32), 614244bv32)) && ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_17[63:63], v_skolemized_q#valueAsBitvector_17[62:52], v_skolemized_q#valueAsBitvector_17[51:0])) && ~bvadd64(1023bv32, k) == ~bvashr32(v_skolemized_q#valueAsBitvector_17[63:32], 20bv32)) [2022-07-12 03:02:35,370 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((aux-res == 0.0 && __signbit_double(res) == 0-aux && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == zero) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == \result [2022-07-12 03:02:35,371 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: aux-res == 0.0 && __signbit_double(res) == 0-aux && 0bv32 == \result [2022-07-12 03:02:35,387 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-12 03:02:35,389 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-12 03:02:35,389 INFO L158 Benchmark]: Toolchain (without parser) took 94955.66ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 50.1MB in the beginning and 49.3MB in the end (delta: 850.9kB). Peak memory consumption was 25.5MB. Max. memory is 16.1GB. [2022-07-12 03:02:35,390 INFO L158 Benchmark]: CDTParser took 0.69ms. Allocated memory is still 69.2MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-12 03:02:35,390 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.01ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 50.7MB in the end (delta: -711.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-12 03:02:35,390 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.92ms. Allocated memory is still 69.2MB. Free memory was 50.7MB in the beginning and 48.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:02:35,390 INFO L158 Benchmark]: Boogie Preprocessor took 52.59ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 46.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-12 03:02:35,391 INFO L158 Benchmark]: RCFGBuilder took 23255.16ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 46.5MB in the beginning and 75.2MB in the end (delta: -28.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. [2022-07-12 03:02:35,391 INFO L158 Benchmark]: TraceAbstraction took 71262.75ms. Allocated memory is still 94.4MB. Free memory was 74.4MB in the beginning and 52.9MB in the end (delta: 21.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2022-07-12 03:02:35,391 INFO L158 Benchmark]: Witness Printer took 44.16ms. Allocated memory is still 94.4MB. Free memory was 52.9MB in the beginning and 49.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-12 03:02:35,393 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.69ms. Allocated memory is still 69.2MB. Free memory was 52.2MB in the beginning and 52.1MB in the end (delta: 48.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.01ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 50.7MB in the end (delta: -711.4kB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.92ms. Allocated memory is still 69.2MB. Free memory was 50.7MB in the beginning and 48.6MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.59ms. Allocated memory is still 69.2MB. Free memory was 48.6MB in the beginning and 46.8MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 23255.16ms. Allocated memory was 69.2MB in the beginning and 94.4MB in the end (delta: 25.2MB). Free memory was 46.5MB in the beginning and 75.2MB in the end (delta: -28.7MB). Peak memory consumption was 19.0MB. Max. memory is 16.1GB. * TraceAbstraction took 71262.75ms. Allocated memory is still 94.4MB. Free memory was 74.4MB in the beginning and 52.9MB in the end (delta: 21.5MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Witness Printer took 44.16ms. Allocated memory is still 94.4MB. Free memory was 52.9MB in the beginning and 49.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. 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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,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_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,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_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] - 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 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 * 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: 152]: 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, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 71.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 46.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 18 mSolverCounterUnknown, 89 SdHoareTripleChecker+Valid, 43.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 89 mSDsluCounter, 594 SdHoareTripleChecker+Invalid, 41.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 73 IncrementalHoareTripleChecker+Unchecked, 385 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 51 IncrementalHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 209 mSDtfsCounter, 51 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 122 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 9.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=33occurred in iteration=0, InterpolantAutomatonStates: 45, 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, 23 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 129 HoareAnnotationTreeSize, 7 FomulaSimplifications, 103 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 32 FormulaSimplificationTreeSizeReductionInter, 2.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 5.5s SatisfiabilityAnalysisTime, 14.7s InterpolantComputationTime, 121 NumberOfCodeBlocks, 121 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 113 ConstructedInterpolants, 36 QuantifiedInterpolants, 987 SizeOfPredicates, 47 NumberOfNonLiveVariables, 566 ConjunctsInSsa, 84 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: 140]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 52]: Loop Invariant [2022-07-12 03:02:35,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,400 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) == x && ~Pluszero~LONGDOUBLE() == zero) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 78]: Loop Invariant [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,401 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_20,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] [2022-07-12 03:02:35,402 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_skolemized_q#valueAsBitvector_17,QUANTIFIED] Derived loop invariant: ((((\exists v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13 : bv32, v_skolemized_q#valueAsBitvector_20 : bv64 :: (~bvand32(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13][4bv32], 1048575bv32) == hx && ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_20[63:63], v_skolemized_q#valueAsBitvector_20[62:52], v_skolemized_q#valueAsBitvector_20[51:0]) == x) && v_skolemized_q#valueAsBitvector_20[63:32] == unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_log_~#ew_u~1#1.base_13][4bv32]) && ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) == x) && ~Pluszero~LONGDOUBLE() == zero) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && (\exists v_skolemized_q#valueAsBitvector_17 : bv64, currentRoundingMode : FloatRoundingMode :: (i == ~bvand32(1048576bv32, ~bvadd64(~bvand32(v_skolemized_q#valueAsBitvector_17[63:32], 1048575bv32), 614244bv32)) && ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0) == ~fp~LONGDOUBLE(v_skolemized_q#valueAsBitvector_17[63:63], v_skolemized_q#valueAsBitvector_17[62:52], v_skolemized_q#valueAsBitvector_17[51:0])) && ~bvadd64(1023bv32, k) == ~bvashr32(v_skolemized_q#valueAsBitvector_17[63:32], 20bv32)) - InvariantResult [Line: 128]: Loop Invariant Derived loop invariant: aux-res == 0.0 && __signbit_double(res) == 0-aux && 0bv32 == \result - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (((aux-res == 0.0 && __signbit_double(res) == 0-aux && res == ~Pluszero~LONGDOUBLE()) && ~Pluszero~LONGDOUBLE() == zero) && ~Pluszero~LONGDOUBLE() == x) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 47]: Loop Invariant [2022-07-12 03:02:35,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,403 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-12 03:02:35,404 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) == x && ~Pluszero~LONGDOUBLE() == zero) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven) && ~fp.sub~DOUBLE(~roundNearestTiesToEven, ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0), ~to_fp~LONGDOUBLE(~roundNearestTiesToEven, 1.0)) == f) && ~Pluszero~LONGDOUBLE() == \result - InvariantResult [Line: 67]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-12 03:02:35,606 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-07-12 03:02:35,668 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 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE