./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-newlib/float_req_bl_0930.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_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 d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:54:26,064 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:54:26,066 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:54:26,102 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:54:26,103 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:54:26,104 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:54:26,108 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:54:26,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:54:26,111 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:54:26,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:54:26,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:54:26,118 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:54:26,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:54:26,120 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:54:26,121 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:54:26,124 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:54:26,124 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:54:26,126 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:54:26,127 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:54:26,132 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:54:26,133 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:54:26,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:54:26,135 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:54:26,136 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:54:26,137 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:54:26,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:54:26,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:54:26,144 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:54:26,145 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:54:26,145 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:54:26,146 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:54:26,147 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:54:26,148 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:54:26,149 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:54:26,149 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:54:26,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:54:26,150 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:54:26,150 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:54:26,151 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:54:26,151 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:54:26,151 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:54:26,153 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:54:26,154 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 14:54:26,183 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:54:26,183 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:54:26,184 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:54:26,184 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:54:26,185 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:54:26,185 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:54:26,185 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:54:26,186 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:54:26,186 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:54:26,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:54:26,187 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:54:26,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 14:54:26,187 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:54:26,187 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:54:26,187 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:54:26,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:54:26,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:54:26,188 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:54:26,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:54:26,188 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:54:26,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:54:26,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:54:26,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:54:26,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:54:26,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:54:26,190 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:54:26,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:54:26,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:54:26,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 14:54:26,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 14:54:26,190 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:54:26,191 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:54:26,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:54:26,191 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 -> d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 [2022-07-13 14:54:26,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:54:26,493 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:54:26,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:54:26,496 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:54:26,497 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:54:26,498 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-13 14:54:26,555 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c841acb5e/b1d3f0fab56149968f414800199d6ece/FLAGecd8efa8e [2022-07-13 14:54:26,957 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:54:26,958 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-13 14:54:26,964 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c841acb5e/b1d3f0fab56149968f414800199d6ece/FLAGecd8efa8e [2022-07-13 14:54:27,367 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c841acb5e/b1d3f0fab56149968f414800199d6ece [2022-07-13 14:54:27,369 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:54:27,370 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:54:27,373 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:54:27,373 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:54:27,375 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:54:27,376 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,377 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60976443 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27, skipping insertion in model container [2022-07-13 14:54:27,377 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,383 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:54:27,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:54:27,561 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c[3104,3117] [2022-07-13 14:54:27,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:54:27,572 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:54:27,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/float_req_bl_0930.c[3104,3117] [2022-07-13 14:54:27,612 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:54:27,625 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:54:27,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27 WrapperNode [2022-07-13 14:54:27,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:54:27,627 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:54:27,627 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:54:27,627 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:54:27,633 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,641 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,664 INFO L137 Inliner]: procedures = 17, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 169 [2022-07-13 14:54:27,665 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:54:27,667 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:54:27,667 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:54:27,667 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:54:27,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,678 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,678 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,693 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:54:27,699 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:54:27,699 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:54:27,699 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:54:27,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (1/1) ... [2022-07-13 14:54:27,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:54:27,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:54:27,733 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-13 14:54:27,737 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-13 14:54:27,763 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:54:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 14:54:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:54:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-13 14:54:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-13 14:54:27,764 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2022-07-13 14:54:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:54:27,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:54:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-13 14:54:27,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:54:27,835 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:54:27,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:54:28,092 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:54:28,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:54:28,097 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-13 14:54:28,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:54:28 BoogieIcfgContainer [2022-07-13 14:54:28,099 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:54:28,100 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:54:28,100 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:54:28,103 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:54:28,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:54:27" (1/3) ... [2022-07-13 14:54:28,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ae945f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:54:28, skipping insertion in model container [2022-07-13 14:54:28,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:27" (2/3) ... [2022-07-13 14:54:28,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ae945f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:54:28, skipping insertion in model container [2022-07-13 14:54:28,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:54:28" (3/3) ... [2022-07-13 14:54:28,106 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0930.c [2022-07-13 14:54:28,136 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:54:28,136 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:54:28,189 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:54:28,207 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@2d8ee9ba, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@54ee0e10 [2022-07-13 14:54:28,208 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:54:28,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 37 states have internal predecessors, (62), 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-13 14:54:28,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 14:54:28,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:28,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:54:28,220 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:28,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:28,226 INFO L85 PathProgramCache]: Analyzing trace with hash -1903470238, now seen corresponding path program 1 times [2022-07-13 14:54:28,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:54:28,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167748720] [2022-07-13 14:54:28,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:28,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:54:28,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:28,395 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-13 14:54:28,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 14:54:28,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167748720] [2022-07-13 14:54:28,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167748720] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:28,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:28,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:54:28,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191397003] [2022-07-13 14:54:28,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:28,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:54:28,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 14:54:28,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:54:28,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:54:28,435 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.7222222222222223) internal successors, (62), 37 states have internal predecessors, (62), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 14:54:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:54:28,453 INFO L93 Difference]: Finished difference Result 74 states and 122 transitions. [2022-07-13 14:54:28,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:54:28,455 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-07-13 14:54:28,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:54:28,469 INFO L225 Difference]: With dead ends: 74 [2022-07-13 14:54:28,469 INFO L226 Difference]: Without dead ends: 35 [2022-07-13 14:54:28,472 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-13 14:54:28,476 INFO L413 NwaCegarLoop]: 51 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, 51 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-13 14:54:28,477 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:54:28,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-13 14:54:28,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-13 14:54:28,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.411764705882353) internal successors, (48), 34 states have internal predecessors, (48), 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-13 14:54:28,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 48 transitions. [2022-07-13 14:54:28,512 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 48 transitions. Word has length 9 [2022-07-13 14:54:28,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:54:28,512 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 48 transitions. [2022-07-13 14:54:28,513 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 14:54:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 48 transitions. [2022-07-13 14:54:28,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:54:28,514 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:28,514 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:54:28,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-13 14:54:28,514 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:28,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1484880575, now seen corresponding path program 1 times [2022-07-13 14:54:28,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 14:54:28,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165975019] [2022-07-13 14:54:28,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:28,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 14:54:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:54:28,582 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 14:54:28,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 14:54:28,647 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 14:54:28,647 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 14:54:28,649 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:54:28,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-13 14:54:28,655 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-13 14:54:28,658 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:54:28,682 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:54:28 BoogieIcfgContainer [2022-07-13 14:54:28,682 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:54:28,683 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:54:28,683 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:54:28,683 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:54:28,684 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:54:28" (3/4) ... [2022-07-13 14:54:28,686 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-13 14:54:28,686 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:54:28,687 INFO L158 Benchmark]: Toolchain (without parser) took 1316.79ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 45.1MB in the beginning and 61.1MB in the end (delta: -16.1MB). Peak memory consumption was 2.9MB. Max. memory is 16.1GB. [2022-07-13 14:54:28,688 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:54:28,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.73ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 44.8MB in the beginning and 80.3MB in the end (delta: -35.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. [2022-07-13 14:54:28,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.04ms. Allocated memory is still 102.8MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:54:28,689 INFO L158 Benchmark]: Boogie Preprocessor took 31.30ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 76.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:54:28,690 INFO L158 Benchmark]: RCFGBuilder took 400.25ms. Allocated memory is still 102.8MB. Free memory was 76.7MB in the beginning and 61.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-13 14:54:28,690 INFO L158 Benchmark]: TraceAbstraction took 582.23ms. Allocated memory is still 102.8MB. Free memory was 61.3MB in the beginning and 61.7MB in the end (delta: -403.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:54:28,691 INFO L158 Benchmark]: Witness Printer took 3.52ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 61.1MB in the end (delta: 557.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:54:28,693 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.19ms. Allocated memory is still 83.9MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.73ms. Allocated memory was 83.9MB in the beginning and 102.8MB in the end (delta: 18.9MB). Free memory was 44.8MB in the beginning and 80.3MB in the end (delta: -35.5MB). Peak memory consumption was 15.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.04ms. Allocated memory is still 102.8MB. Free memory was 80.3MB in the beginning and 78.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.30ms. Allocated memory is still 102.8MB. Free memory was 78.2MB in the beginning and 76.7MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 400.25ms. Allocated memory is still 102.8MB. Free memory was 76.7MB in the beginning and 61.8MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 582.23ms. Allocated memory is still 102.8MB. Free memory was 61.3MB in the beginning and 61.7MB in the end (delta: -403.8kB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.52ms. Allocated memory is still 102.8MB. Free memory was 61.7MB in the beginning and 61.1MB in the end (delta: 557.0kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 123]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 122, overapproximation of someBinaryArithmeticFLOAToperation at line 34, overapproximation of bitwiseAnd at line 33. Possible FailurePath: [L14-L18] static const float ln2_hi_log = 6.9313812256e-01, ln2_lo_log = 9.0580006145e-06, two25_log = 3.355443200e+07, Lg1_log = 6.6666668653e-01, Lg2_log = 4.0000000596e-01, Lg3_log = 2.8571429849e-01, Lg4_log = 2.2222198546e-01, Lg5_log = 1.8183572590e-01, Lg6_log = 1.5313838422e-01, Lg7_log = 1.4798198640e-01; [L20] static const float zero_log = 0.0; VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, zero_log=0] [L118] float x = 1.0f; [L119] CALL, EXPR __ieee754_logf(x) [L23] float hfsq, f, s, z, R, w, t1, t2, dk; [L24] __int32_t k, ix, i, j; VAL [\old(x)=1, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=1, zero_log=0] [L27] ieee_float_shape_type gf_u; [L28] gf_u.value = (x) [L29] EXPR gf_u.word [L29] (ix) = gf_u.word [L32] k = 0 VAL [\old(x)=1, ix=-1, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=1, zero_log=0] [L33] COND TRUE ((ix & 0x7fffffff) == 0) [L34] return -two25_log / zero_log; VAL [\old(x)=1, ix=-1, k=0, Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, two25_log=33554432, x=1, zero_log=0] [L119] RET, EXPR __ieee754_logf(x) [L119] float res = __ieee754_logf(x); [L122] EXPR res == 0.0f && __signbit_float(res) == 0 VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, res=4294967296, res == 0.0f && __signbit_float(res) == 0=0, two25_log=33554432, x=1, zero_log=0] [L122] COND TRUE !(res == 0.0f && __signbit_float(res) == 0) [L123] reach_error() VAL [Lg1_log=66666668653/100000000000, Lg2_log=10000000149/25000000000, Lg3_log=28571429849/100000000000, Lg4_log=11111099273/50000000000, Lg5_log=1818357259/10000000000, Lg6_log=7656919211/50000000000, Lg7_log=184977483/1250000000, ln2_hi_log=2166056633/3125000000, ln2_lo_log=18116001229/2000000000000000, res=4294967296, two25_log=33554432, x=1, zero_log=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 51 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, 51 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=38occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 19 NumberOfCodeBlocks, 19 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 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-13 14:54:28,743 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-newlib/float_req_bl_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 d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 14:54:30,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 14:54:30,696 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 14:54:30,732 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 14:54:30,735 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 14:54:30,736 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 14:54:30,740 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 14:54:30,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 14:54:30,745 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 14:54:30,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 14:54:30,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 14:54:30,754 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 14:54:30,755 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 14:54:30,757 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 14:54:30,758 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 14:54:30,761 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 14:54:30,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 14:54:30,762 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 14:54:30,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 14:54:30,769 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 14:54:30,770 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 14:54:30,771 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 14:54:30,772 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 14:54:30,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 14:54:30,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 14:54:30,781 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 14:54:30,781 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 14:54:30,781 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 14:54:30,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 14:54:30,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 14:54:30,783 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 14:54:30,784 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 14:54:30,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 14:54:30,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 14:54:30,787 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 14:54:30,788 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 14:54:30,788 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 14:54:30,788 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 14:54:30,789 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 14:54:30,789 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 14:54:30,790 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 14:54:30,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 14:54:30,797 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-13 14:54:30,819 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 14:54:30,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 14:54:30,821 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 14:54:30,821 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 14:54:30,822 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 14:54:30,822 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 14:54:30,823 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 14:54:30,823 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 14:54:30,823 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 14:54:30,824 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 14:54:30,824 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 14:54:30,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 14:54:30,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 14:54:30,825 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 14:54:30,825 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 14:54:30,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 14:54:30,825 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-13 14:54:30,825 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-13 14:54:30,826 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-13 14:54:30,826 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 14:54:30,826 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 14:54:30,826 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 14:54:30,827 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 14:54:30,827 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 14:54:30,827 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 14:54:30,827 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 14:54:30,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:54:30,828 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 14:54:30,828 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 14:54:30,828 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 14:54:30,828 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-13 14:54:30,828 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-13 14:54:30,829 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 14:54:30,829 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 14:54:30,829 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 14:54:30,829 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-13 14:54:30,830 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 -> d0cec7ddb8a2645a0ba1656999ba73d1a21b29e3fbe1129f436b67dd30c2f050 [2022-07-13 14:54:31,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 14:54:31,150 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 14:54:31,153 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 14:54:31,154 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 14:54:31,154 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 14:54:31,156 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-13 14:54:31,213 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcad14e08/24927ca4d0a24032b0a9f69d8416837f/FLAGc1cefd0dc [2022-07-13 14:54:31,678 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 14:54:31,684 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c [2022-07-13 14:54:31,692 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcad14e08/24927ca4d0a24032b0a9f69d8416837f/FLAGc1cefd0dc [2022-07-13 14:54:31,712 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bcad14e08/24927ca4d0a24032b0a9f69d8416837f [2022-07-13 14:54:31,714 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 14:54:31,716 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 14:54:31,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 14:54:31,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 14:54:31,721 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 14:54:31,722 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:54:31" (1/1) ... [2022-07-13 14:54:31,723 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e080c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:31, skipping insertion in model container [2022-07-13 14:54:31,724 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 02:54:31" (1/1) ... [2022-07-13 14:54:31,729 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 14:54:31,755 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 14:54:31,943 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c[3104,3117] [2022-07-13 14:54:31,954 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:54:31,964 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 14:54:31,994 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-newlib/float_req_bl_0930.c[3104,3117] [2022-07-13 14:54:31,995 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 14:54:32,014 INFO L208 MainTranslator]: Completed translation [2022-07-13 14:54:32,015 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32 WrapperNode [2022-07-13 14:54:32,015 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 14:54:32,016 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 14:54:32,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 14:54:32,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 14:54:32,022 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,045 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,066 INFO L137 Inliner]: procedures = 20, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 157 [2022-07-13 14:54:32,067 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 14:54:32,067 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 14:54:32,068 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 14:54:32,068 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 14:54:32,075 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,075 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,089 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,096 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,099 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 14:54:32,100 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 14:54:32,100 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 14:54:32,101 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 14:54:32,101 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (1/1) ... [2022-07-13 14:54:32,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 14:54:32,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 14:54:32,133 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-13 14:54:32,142 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-13 14:54:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 14:54:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-13 14:54:32,168 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-13 14:54:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-13 14:54:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-13 14:54:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 14:54:32,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 14:54:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4 [2022-07-13 14:54:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-13 14:54:32,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-13 14:54:32,238 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 14:54:32,240 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 14:54:50,598 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 14:54:50,603 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 14:54:50,603 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-13 14:54:50,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:54:50 BoogieIcfgContainer [2022-07-13 14:54:50,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 14:54:50,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 14:54:50,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 14:54:50,610 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 14:54:50,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 02:54:31" (1/3) ... [2022-07-13 14:54:50,611 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa37794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:54:50, skipping insertion in model container [2022-07-13 14:54:50,611 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 02:54:32" (2/3) ... [2022-07-13 14:54:50,612 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aa37794 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 02:54:50, skipping insertion in model container [2022-07-13 14:54:50,612 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:54:50" (3/3) ... [2022-07-13 14:54:50,614 INFO L111 eAbstractionObserver]: Analyzing ICFG float_req_bl_0930.c [2022-07-13 14:54:50,626 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 14:54:50,626 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 14:54:50,663 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 14:54:50,668 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@6497fff1, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1b05c294 [2022-07-13 14:54:50,668 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 14:54:50,672 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 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-13 14:54:50,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-13 14:54:50,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:50,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:54:50,679 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:50,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1904085918, now seen corresponding path program 1 times [2022-07-13 14:54:50,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:54:50,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [553315275] [2022-07-13 14:54:50,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:50,697 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:54:50,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:54:50,700 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-13 14:54:50,723 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-13 14:54:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:51,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 14:54:51,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:54:51,242 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-13 14:54:51,243 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:54:51,243 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:54:51,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [553315275] [2022-07-13 14:54:51,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [553315275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:51,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:51,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 14:54:51,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829085965] [2022-07-13 14:54:51,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:51,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 14:54:51,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:54:51,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 14:54:51,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 14:54:51,274 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.6875) internal successors, (54), 33 states have internal predecessors, (54), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 14:54:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:54:51,288 INFO L93 Difference]: Finished difference Result 66 states and 106 transitions. [2022-07-13 14:54:51,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 14:54:51,290 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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 9 [2022-07-13 14:54:51,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:54:51,297 INFO L225 Difference]: With dead ends: 66 [2022-07-13 14:54:51,298 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:54:51,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-13 14:54:51,303 INFO L413 NwaCegarLoop]: 45 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, 45 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-13 14:54:51,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 14:54:51,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:54:51,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:54:51,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.4) internal successors, (42), 30 states have internal predecessors, (42), 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-13 14:54:51,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 42 transitions. [2022-07-13 14:54:51,330 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 42 transitions. Word has length 9 [2022-07-13 14:54:51,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:54:51,330 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 42 transitions. [2022-07-13 14:54:51,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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-13 14:54:51,331 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 42 transitions. [2022-07-13 14:54:51,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-13 14:54:51,332 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:51,332 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:54:51,348 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-13 14:54:51,539 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-13 14:54:51,540 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:51,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:51,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1484264895, now seen corresponding path program 1 times [2022-07-13 14:54:51,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:54:51,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1433254548] [2022-07-13 14:54:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:51,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:54:51,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:54:51,545 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-13 14:54:51,545 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-13 14:54:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:51,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:54:51,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:54:52,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-13 14:54:52,143 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:54:52,143 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:54:52,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1433254548] [2022-07-13 14:54:52,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1433254548] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:52,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:52,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:54:52,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584856969] [2022-07-13 14:54:52,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:52,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:54:52,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:54:52,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:54:52,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:54:52,146 INFO L87 Difference]: Start difference. First operand 31 states and 42 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-13 14:54:52,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:54:52,153 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-07-13 14:54:52,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:54:52,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-13 14:54:52,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:54:52,160 INFO L225 Difference]: With dead ends: 40 [2022-07-13 14:54:52,160 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:54:52,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:54:52,162 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 20 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:54:52,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 96 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 20 Unchecked, 0.0s Time] [2022-07-13 14:54:52,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:54:52,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:54:52,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3666666666666667) internal successors, (41), 30 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-13 14:54:52,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 41 transitions. [2022-07-13 14:54:52,167 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 41 transitions. Word has length 10 [2022-07-13 14:54:52,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:54:52,168 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 41 transitions. [2022-07-13 14:54:52,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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-13 14:54:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 41 transitions. [2022-07-13 14:54:52,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-13 14:54:52,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:52,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:54:52,195 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-13 14:54:52,389 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-13 14:54:52,389 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:52,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:52,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1245957376, now seen corresponding path program 1 times [2022-07-13 14:54:52,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:54:52,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1455984371] [2022-07-13 14:54:52,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:52,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:54:52,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:54:52,393 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-13 14:54:52,395 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-13 14:54:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:52,795 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:54:52,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:54:52,999 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-13 14:54:53,000 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:54:53,000 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:54:53,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1455984371] [2022-07-13 14:54:53,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1455984371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:53,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:53,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:54:53,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901296648] [2022-07-13 14:54:53,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:53,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:54:53,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:54:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:54:53,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:54:53,003 INFO L87 Difference]: Start difference. First operand 31 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-13 14:54:53,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:54:53,008 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2022-07-13 14:54:53,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:54:53,008 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-13 14:54:53,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:54:53,009 INFO L225 Difference]: With dead ends: 40 [2022-07-13 14:54:53,009 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:54:53,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:54:53,011 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 0 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:54:53,011 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 93 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-07-13 14:54:53,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:54:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:54:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 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-13 14:54:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2022-07-13 14:54:53,015 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 11 [2022-07-13 14:54:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:54:53,016 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2022-07-13 14:54:53,016 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-13 14:54:53,016 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2022-07-13 14:54:53,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-13 14:54:53,017 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:53,017 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:54:53,033 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-13 14:54:53,219 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-13 14:54:53,220 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:53,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:53,221 INFO L85 PathProgramCache]: Analyzing trace with hash 21115748, now seen corresponding path program 1 times [2022-07-13 14:54:53,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:54:53,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [533070717] [2022-07-13 14:54:53,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:53,222 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:54:53,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:54:53,223 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-13 14:54:53,230 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-13 14:54:53,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:53,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:54:53,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:54:53,723 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-13 14:54:53,723 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:54:53,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:54:53,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [533070717] [2022-07-13 14:54:53,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [533070717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:53,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:53,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:54:53,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266012927] [2022-07-13 14:54:53,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:53,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:54:53,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:54:53,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:54:53,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:54:53,726 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:54:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:54:53,730 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-07-13 14:54:53,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:54:53,730 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-13 14:54:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:54:53,730 INFO L225 Difference]: With dead ends: 40 [2022-07-13 14:54:53,731 INFO L226 Difference]: Without dead ends: 31 [2022-07-13 14:54:53,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:54:53,735 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 0 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:54:53,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 90 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-07-13 14:54:53,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-13 14:54:53,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-13 14:54:53,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3) internal successors, (39), 30 states have internal predecessors, (39), 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-13 14:54:53,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-07-13 14:54:53,742 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 12 [2022-07-13 14:54:53,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:54:53,743 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-07-13 14:54:53,743 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:54:53,743 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-07-13 14:54:53,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:54:53,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:53,744 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] [2022-07-13 14:54:53,758 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-07-13 14:54:53,951 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-13 14:54:53,952 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:53,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:53,953 INFO L85 PathProgramCache]: Analyzing trace with hash 933425138, now seen corresponding path program 1 times [2022-07-13 14:54:53,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:54:53,953 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1541811123] [2022-07-13 14:54:53,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:53,954 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:54:53,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:54:53,955 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-13 14:54:53,957 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-13 14:54:54,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:54,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 14:54:54,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:54:54,765 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-13 14:54:54,765 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:54:54,766 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:54:54,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1541811123] [2022-07-13 14:54:54,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1541811123] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:54,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:54,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:54:54,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92846338] [2022-07-13 14:54:54,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:54,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:54:54,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:54:54,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:54:54,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:54:54,768 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 14:54:54,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:54:54,804 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-13 14:54:54,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:54:54,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 20 [2022-07-13 14:54:54,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:54:54,806 INFO L225 Difference]: With dead ends: 45 [2022-07-13 14:54:54,806 INFO L226 Difference]: Without dead ends: 42 [2022-07-13 14:54:54,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:54:54,807 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 24 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 21 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:54:54,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 110 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 21 Unchecked, 0.0s Time] [2022-07-13 14:54:54,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-13 14:54:54,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 33. [2022-07-13 14:54:54,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 32 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-13 14:54:54,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 41 transitions. [2022-07-13 14:54:54,813 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 41 transitions. Word has length 20 [2022-07-13 14:54:54,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:54:54,813 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 41 transitions. [2022-07-13 14:54:54,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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-13 14:54:54,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 41 transitions. [2022-07-13 14:54:54,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:54:54,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:54,815 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] [2022-07-13 14:54:54,835 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-13 14:54:55,031 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-13 14:54:55,032 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:55,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:55,032 INFO L85 PathProgramCache]: Analyzing trace with hash 935272180, now seen corresponding path program 1 times [2022-07-13 14:54:55,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:54:55,033 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2107777575] [2022-07-13 14:54:55,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:55,033 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:54:55,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:54:55,034 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-13 14:54:55,035 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-13 14:54:55,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:55,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 14:54:55,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:54:56,333 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-13 14:54:56,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:54:56,334 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:54:56,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2107777575] [2022-07-13 14:54:56,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2107777575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:56,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:56,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-13 14:54:56,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057975630] [2022-07-13 14:54:56,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:56,335 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:54:56,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:54:56,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:54:56,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:54:56,336 INFO L87 Difference]: Start difference. First operand 33 states and 41 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-13 14:54:56,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:54:56,344 INFO L93 Difference]: Finished difference Result 50 states and 62 transitions. [2022-07-13 14:54:56,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-13 14:54:56,344 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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 20 [2022-07-13 14:54:56,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:54:56,345 INFO L225 Difference]: With dead ends: 50 [2022-07-13 14:54:56,345 INFO L226 Difference]: Without dead ends: 41 [2022-07-13 14:54:56,345 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:54:56,346 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 32 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:54:56,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 106 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 32 Unchecked, 0.0s Time] [2022-07-13 14:54:56,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-13 14:54:56,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2022-07-13 14:54:56,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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-13 14:54:56,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 50 transitions. [2022-07-13 14:54:56,352 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 50 transitions. Word has length 20 [2022-07-13 14:54:56,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:54:56,352 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 50 transitions. [2022-07-13 14:54:56,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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-13 14:54:56,353 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 50 transitions. [2022-07-13 14:54:56,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:54:56,353 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:54:56,353 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] [2022-07-13 14:54:56,383 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-13 14:54:56,579 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-13 14:54:56,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:54:56,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:54:56,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1142140884, now seen corresponding path program 1 times [2022-07-13 14:54:56,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:54:56,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388550756] [2022-07-13 14:54:56,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:54:56,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:54:56,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:54:56,584 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-13 14:54:56,586 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-13 14:54:57,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:54:57,165 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-13 14:54:57,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:54:57,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-13 14:54:58,272 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 93 treesize of output 57 [2022-07-13 14:54:58,594 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-13 14:54:58,594 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:54:58,594 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:54:58,594 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388550756] [2022-07-13 14:54:58,594 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388550756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:54:58,594 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:54:58,594 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-13 14:54:58,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103998320] [2022-07-13 14:54:58,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:54:58,595 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-13 14:54:58,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:54:58,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-13 14:54:58,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-13 14:54:58,596 INFO L87 Difference]: Start difference. First operand 40 states and 50 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-13 14:55:01,398 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.35s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:04,291 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:06,233 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:08,388 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:10,398 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-13 14:55:12,536 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.14s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:14,539 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-13 14:55:16,101 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:17,833 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:20,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:22,127 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.11s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-13 14:55:24,130 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-13 14:55:24,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:55:24,303 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-13 14:55:24,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 14:55:24,308 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-07-13 14:55:24,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:55:24,309 INFO L225 Difference]: With dead ends: 59 [2022-07-13 14:55:24,309 INFO L226 Difference]: Without dead ends: 49 [2022-07-13 14:55:24,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:55:24,310 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 26 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 53 IncrementalHoareTripleChecker+Unchecked, 25.3s IncrementalHoareTripleChecker+Time [2022-07-13 14:55:24,310 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 96 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 9 Unknown, 53 Unchecked, 25.3s Time] [2022-07-13 14:55:24,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-13 14:55:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 40. [2022-07-13 14:55:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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-13 14:55:24,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 49 transitions. [2022-07-13 14:55:24,315 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 49 transitions. Word has length 20 [2022-07-13 14:55:24,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:55:24,315 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 49 transitions. [2022-07-13 14:55:24,316 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 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-13 14:55:24,316 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 49 transitions. [2022-07-13 14:55:24,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-13 14:55:24,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:55:24,317 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] [2022-07-13 14:55:24,345 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-13 14:55:24,535 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-13 14:55:24,536 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:55:24,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:55:24,536 INFO L85 PathProgramCache]: Analyzing trace with hash -656486045, now seen corresponding path program 1 times [2022-07-13 14:55:24,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:55:24,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1272447530] [2022-07-13 14:55:24,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:55:24,536 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:55:24,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:55:24,538 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-13 14:55:24,538 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-13 14:55:25,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:55:25,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 14:55:25,637 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:55:26,122 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-13 14:55:26,123 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:55:26,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:55:26,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1272447530] [2022-07-13 14:55:26,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1272447530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:55:26,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:55:26,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 14:55:26,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12044490] [2022-07-13 14:55:26,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:55:26,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 14:55:26,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:55:26,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 14:55:26,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:55:26,124 INFO L87 Difference]: Start difference. First operand 40 states and 49 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-13 14:55:26,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:55:26,128 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-07-13 14:55:26,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 14:55:26,128 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2022-07-13 14:55:26,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:55:26,129 INFO L225 Difference]: With dead ends: 52 [2022-07-13 14:55:26,129 INFO L226 Difference]: Without dead ends: 40 [2022-07-13 14:55:26,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 14:55:26,130 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 0 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:55:26,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 109 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 18 Unchecked, 0.0s Time] [2022-07-13 14:55:26,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-13 14:55:26,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-07-13 14:55:26,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 39 states have internal predecessors, (48), 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-13 14:55:26,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2022-07-13 14:55:26,139 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 20 [2022-07-13 14:55:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:55:26,139 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2022-07-13 14:55:26,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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-13 14:55:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2022-07-13 14:55:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-13 14:55:26,142 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:55:26,142 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, 1] [2022-07-13 14:55:26,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-07-13 14:55:26,363 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-13 14:55:26,364 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:55:26,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:55:26,364 INFO L85 PathProgramCache]: Analyzing trace with hash 839503006, now seen corresponding path program 1 times [2022-07-13 14:55:26,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:55:26,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [801011824] [2022-07-13 14:55:26,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:55:26,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:55:26,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:55:26,369 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:55:26,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-13 14:55:26,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:55:26,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 14:55:26,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:55:26,976 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-13 14:55:26,976 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:55:26,977 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:55:26,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [801011824] [2022-07-13 14:55:26,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [801011824] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:55:26,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:55:26,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-13 14:55:26,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877497764] [2022-07-13 14:55:26,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:55:26,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 14:55:26,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:55:26,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 14:55:26,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:55:26,978 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:55:26,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:55:26,981 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-13 14:55:26,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 14:55:26,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-13 14:55:26,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:55:26,981 INFO L225 Difference]: With dead ends: 49 [2022-07-13 14:55:26,981 INFO L226 Difference]: Without dead ends: 25 [2022-07-13 14:55:26,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 14:55:26,982 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 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-13 14:55:26,982 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 11 Unchecked, 0.0s Time] [2022-07-13 14:55:26,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-13 14:55:26,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-13 14:55:26,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.0) internal successors, (24), 24 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:55:26,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 24 transitions. [2022-07-13 14:55:26,997 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 24 transitions. Word has length 22 [2022-07-13 14:55:26,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:55:26,998 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 24 transitions. [2022-07-13 14:55:26,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:55:26,998 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 24 transitions. [2022-07-13 14:55:26,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-13 14:55:27,000 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 14:55:27,000 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, 1, 1, 1] [2022-07-13 14:55:27,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-13 14:55:27,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:55:27,220 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 14:55:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 14:55:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 722082119, now seen corresponding path program 1 times [2022-07-13 14:55:27,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-13 14:55:27,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1700779134] [2022-07-13 14:55:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 14:55:27,221 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-13 14:55:27,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-13 14:55:27,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-13 14:55:27,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-13 14:55:27,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 14:55:27,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-13 14:55:27,504 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 14:55:28,774 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-13 14:55:28,775 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 14:55:28,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-13 14:55:28,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1700779134] [2022-07-13 14:55:28,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1700779134] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 14:55:28,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 14:55:28,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-13 14:55:28,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930141613] [2022-07-13 14:55:28,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 14:55:28,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-13 14:55:28,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-13 14:55:28,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-13 14:55:28,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-13 14:55:28,777 INFO L87 Difference]: Start difference. First operand 25 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:55:28,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 14:55:28,953 INFO L93 Difference]: Finished difference Result 25 states and 24 transitions. [2022-07-13 14:55:28,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-13 14:55:28,953 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-13 14:55:28,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 14:55:28,953 INFO L225 Difference]: With dead ends: 25 [2022-07-13 14:55:28,953 INFO L226 Difference]: Without dead ends: 0 [2022-07-13 14:55:28,953 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-13 14:55:28,954 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 1 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 14:55:28,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-07-13 14:55:28,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-13 14:55:28,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-13 14:55:28,955 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-13 14:55:28,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-13 14:55:28,955 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-07-13 14:55:28,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 14:55:28,955 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-13 14:55:28,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 8 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-13 14:55:28,955 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-13 14:55:28,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-13 14:55:28,957 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 14:55:28,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-13 14:55:29,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-13 14:55:29,160 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-13 14:55:30,211 INFO L899 garLoopResultBuilder]: For program point L93(lines 93 96) no Hoare annotation was computed. [2022-07-13 14:55:30,211 INFO L899 garLoopResultBuilder]: For program point L60(lines 60 65) no Hoare annotation was computed. [2022-07-13 14:55:30,211 INFO L899 garLoopResultBuilder]: For program point L85(lines 85 97) no Hoare annotation was computed. [2022-07-13 14:55:30,211 INFO L902 garLoopResultBuilder]: At program point L127(lines 112 128) the Hoare annotation is: true [2022-07-13 14:55:30,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-07-13 14:55:30,211 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-07-13 14:55:30,212 INFO L899 garLoopResultBuilder]: For program point L103-1(lines 103 107) no Hoare annotation was computed. [2022-07-13 14:55:30,212 INFO L899 garLoopResultBuilder]: For program point L37(lines 37 38) no Hoare annotation was computed. [2022-07-13 14:55:30,212 INFO L895 garLoopResultBuilder]: At program point L103-2(lines 103 107) the Hoare annotation is: (and (or |ULTIMATE.start_main_#t~short10#1| (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0))) (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) |ULTIMATE.start___signbit_float_~x#1|))) [2022-07-13 14:55:30,212 INFO L899 garLoopResultBuilder]: For program point L103-3(lines 103 107) no Hoare annotation was computed. [2022-07-13 14:55:30,212 INFO L899 garLoopResultBuilder]: For program point L87(lines 87 91) no Hoare annotation was computed. [2022-07-13 14:55:30,212 INFO L895 garLoopResultBuilder]: At program point L96(lines 22 98) the Hoare annotation is: (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_logf_#res#1| ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)))) [2022-07-13 14:55:30,213 INFO L899 garLoopResultBuilder]: For program point L39(lines 39 47) no Hoare annotation was computed. [2022-07-13 14:55:30,213 INFO L899 garLoopResultBuilder]: For program point L39-1(lines 39 47) no Hoare annotation was computed. [2022-07-13 14:55:30,213 INFO L899 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-07-13 14:55:30,213 INFO L899 garLoopResultBuilder]: For program point L122-2(lines 122 125) no Hoare annotation was computed. [2022-07-13 14:55:30,213 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-07-13 14:55:30,213 INFO L899 garLoopResultBuilder]: For program point L123(line 123) no Hoare annotation was computed. [2022-07-13 14:55:30,213 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 123) no Hoare annotation was computed. [2022-07-13 14:55:30,214 INFO L899 garLoopResultBuilder]: For program point L33(lines 33 34) no Hoare annotation was computed. [2022-07-13 14:55:30,214 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-07-13 14:55:30,214 INFO L899 garLoopResultBuilder]: For program point L58(lines 58 74) no Hoare annotation was computed. [2022-07-13 14:55:30,214 INFO L899 garLoopResultBuilder]: For program point L42-1(lines 42 46) no Hoare annotation was computed. [2022-07-13 14:55:30,214 INFO L895 garLoopResultBuilder]: At program point L42-2(lines 42 46) the Hoare annotation is: false [2022-07-13 14:55:30,214 INFO L899 garLoopResultBuilder]: For program point L59(lines 59 66) no Hoare annotation was computed. [2022-07-13 14:55:30,214 INFO L899 garLoopResultBuilder]: For program point L26-1(lines 26 30) no Hoare annotation was computed. [2022-07-13 14:55:30,215 INFO L895 garLoopResultBuilder]: At program point L26-2(lines 26 30) the Hoare annotation is: (and (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0)) (exists ((currentRoundingMode RoundingMode)) (= |ULTIMATE.start___ieee754_logf_~x#1| ((_ to_fp 8 24) currentRoundingMode 1.0))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:55:30,215 INFO L899 garLoopResultBuilder]: For program point L26-3(lines 26 30) no Hoare annotation was computed. [2022-07-13 14:55:30,215 INFO L899 garLoopResultBuilder]: For program point L51-1(lines 51 55) no Hoare annotation was computed. [2022-07-13 14:55:30,215 INFO L895 garLoopResultBuilder]: At program point L51-2(lines 51 55) the Hoare annotation is: (and (exists ((|v_ULTIMATE.start___ieee754_logf_~ix~0#1_18| (_ BitVec 32)) (currentRoundingMode RoundingMode)) (and (= |ULTIMATE.start___ieee754_logf_~i~0#1| (bvand (bvadd (_ bv4913952 32) (bvand (_ bv8388607 32) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|)) (_ bv8388608 32))) (= ((_ to_fp 8 24) currentRoundingMode 1.0) (fp ((_ extract 31 31) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|) ((_ extract 30 23) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|) ((_ extract 22 0) |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18|))) (= (bvmul (bvashr |v_ULTIMATE.start___ieee754_logf_~ix~0#1_18| (_ bv23 32)) (_ bv1 32)) (bvadd |ULTIMATE.start___ieee754_logf_~k~0#1| (_ bv127 32))))) (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0)) (exists ((|v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15| (_ BitVec 32))) (let ((.cse0 (select (select |#memory_int| |v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15|) (_ bv0 32)))) (and (= (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)) ((_ to_fp 8 24) currentRoundingMode 1.0)) (= (bvand (_ bv8388607 32) .cse0) |ULTIMATE.start___ieee754_logf_~ix~0#1|)))) (= currentRoundingMode roundNearestTiesToEven)) [2022-07-13 14:55:30,215 INFO L899 garLoopResultBuilder]: For program point L51-3(lines 51 55) no Hoare annotation was computed. [2022-07-13 14:55:30,215 INFO L895 garLoopResultBuilder]: At program point L109(lines 100 110) the Hoare annotation is: (and (= |ULTIMATE.start___signbit_float_#res#1| (_ bv0 32)) (or |ULTIMATE.start_main_#t~short10#1| (exists ((currentRoundingMode RoundingMode)) (= ((_ to_fp 8 24) currentRoundingMode (_ +zero 11 53)) ~zero_log~0)))) [2022-07-13 14:55:30,215 INFO L899 garLoopResultBuilder]: For program point L68(lines 68 73) no Hoare annotation was computed. [2022-07-13 14:55:30,216 INFO L899 garLoopResultBuilder]: For program point L35(lines 35 36) no Hoare annotation was computed. [2022-07-13 14:55:30,218 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 14:55:30,220 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 14:55:30,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,226 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,227 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,228 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,228 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,228 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,230 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:55:30,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,234 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,235 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,236 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,236 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:55:30,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,237 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,238 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,239 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:55:30,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,240 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,240 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:55:30,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 02:55:30 BoogieIcfgContainer [2022-07-13 14:55:30,241 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 14:55:30,242 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 14:55:30,242 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 14:55:30,242 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 14:55:30,243 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 02:54:50" (3/4) ... [2022-07-13 14:55:30,245 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-13 14:55:30,255 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 21 nodes and edges [2022-07-13 14:55:30,255 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-07-13 14:55:30,255 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-13 14:55:30,255 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-13 14:55:30,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:55:30,275 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE())) [2022-07-13 14:55:30,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((\exists v_ULTIMATE.start___ieee754_logf_~ix~0#1_18 : bv32, currentRoundingMode : FloatRoundingMode :: (i == ~bvand32(~bvadd64(4913952bv32, ~bvand32(8388607bv32, v_ULTIMATE.start___ieee754_logf_~ix~0#1_18)), 8388608bv32) && ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0) == ~fp~LONGDOUBLE(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[31:31], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[30:23], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[22:0])) && ~bvmul32(~bvashr32(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18, 23bv32), 1bv32) == ~bvadd64(k, 127bv32)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) && ~bvand32(8388607bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32]) == ix)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven [2022-07-13 14:55:30,276 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == x) [2022-07-13 14:55:30,277 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: \result == 0bv32 && (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) [2022-07-13 14:55:30,300 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 14:55:30,301 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 14:55:30,301 INFO L158 Benchmark]: Toolchain (without parser) took 58585.50ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 32.9MB in the beginning and 29.6MB in the end (delta: 3.3MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-07-13 14:55:30,301 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 14:55:30,302 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.94ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 35.1MB in the end (delta: -2.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-07-13 14:55:30,302 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.22ms. Allocated memory is still 54.5MB. Free memory was 35.1MB in the beginning and 33.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:55:30,303 INFO L158 Benchmark]: Boogie Preprocessor took 32.06ms. Allocated memory is still 54.5MB. Free memory was 33.0MB in the beginning and 31.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 14:55:30,303 INFO L158 Benchmark]: RCFGBuilder took 18504.68ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.1MB in the beginning and 41.4MB in the end (delta: -10.3MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2022-07-13 14:55:30,303 INFO L158 Benchmark]: TraceAbstraction took 39634.13ms. Allocated memory is still 67.1MB. Free memory was 41.0MB in the beginning and 33.6MB in the end (delta: 7.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-07-13 14:55:30,304 INFO L158 Benchmark]: Witness Printer took 58.85ms. Allocated memory is still 67.1MB. Free memory was 33.6MB in the beginning and 29.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 14:55:30,308 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.18ms. Allocated memory is still 54.5MB. Free memory was 36.3MB in the beginning and 36.2MB in the end (delta: 44.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 296.94ms. Allocated memory is still 54.5MB. Free memory was 32.7MB in the beginning and 35.1MB in the end (delta: -2.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.22ms. Allocated memory is still 54.5MB. Free memory was 35.1MB in the beginning and 33.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.06ms. Allocated memory is still 54.5MB. Free memory was 33.0MB in the beginning and 31.1MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 18504.68ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 31.1MB in the beginning and 41.4MB in the end (delta: -10.3MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. * TraceAbstraction took 39634.13ms. Allocated memory is still 67.1MB. Free memory was 41.0MB in the beginning and 33.6MB in the end (delta: 7.3MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Witness Printer took 58.85ms. Allocated memory is still 67.1MB. Free memory was 33.6MB in the beginning and 29.6MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,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_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,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_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,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_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,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_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,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[currentRoundingMode,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[currentRoundingMode,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[currentRoundingMode,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[currentRoundingMode,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,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[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 123]: 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, 34 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.6s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.1s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 54 SdHoareTripleChecker+Valid, 25.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 54 mSDsluCounter, 895 SdHoareTripleChecker+Invalid, 25.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 203 IncrementalHoareTripleChecker+Unchecked, 581 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 29 IncrementalHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 314 mSDtfsCounter, 29 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 161 GetRequests, 126 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=6, InterpolantAutomatonStates: 52, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 19 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 13 NumberOfFragments, 126 HoareAnnotationTreeSize, 7 FomulaSimplifications, 40 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 110 FormulaSimplificationTreeSizeReductionInter, 1.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 4.0s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 158 ConstructedInterpolants, 92 QuantifiedInterpolants, 1428 SizeOfPredicates, 62 NumberOfNonLiveVariables, 676 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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: 51]: Loop Invariant [2022-07-13 14:55:30,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,330 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,331 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,331 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,331 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,332 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,333 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,333 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,333 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,334 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:55:30,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,336 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~ix~0#1_18,QUANTIFIED] [2022-07-13 14:55:30,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,337 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,338 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15,QUANTIFIED] [2022-07-13 14:55:30,338 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: (((\exists v_ULTIMATE.start___ieee754_logf_~ix~0#1_18 : bv32, currentRoundingMode : FloatRoundingMode :: (i == ~bvand32(~bvadd64(4913952bv32, ~bvand32(8388607bv32, v_ULTIMATE.start___ieee754_logf_~ix~0#1_18)), 8388608bv32) && ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0) == ~fp~LONGDOUBLE(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[31:31], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[30:23], v_ULTIMATE.start___ieee754_logf_~ix~0#1_18[22:0])) && ~bvmul32(~bvashr32(v_ULTIMATE.start___ieee754_logf_~ix~0#1_18, 23bv32), 1bv32) == ~bvadd64(k, 127bv32)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15 : bv32 :: ~fp~LONGDOUBLE(unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][31:31], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][30:23], unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32][22:0]) == ~to_fp~LONGDOUBLE(unknown-currentRoundingMode-unknown, 1.0) && ~bvand32(8388607bv32, unknown-#memory_int-unknown[v_ULTIMATE.start___ieee754_logf_~#gf_u~0#1.base_15][0bv32]) == ix)) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 100]: Loop Invariant [2022-07-13 14:55:30,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,340 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: \result == 0bv32 && (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) - InvariantResult [Line: 22]: Loop Invariant [2022-07-13 14:55:30,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (\exists currentRoundingMode : FloatRoundingMode :: \result == ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE())) - InvariantResult [Line: 103]: Loop Invariant [2022-07-13 14:55:30,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,343 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] Derived loop invariant: (aux-res == 0.0f && __signbit_float(res) == 0-aux || (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log)) && (\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == x) - InvariantResult [Line: 26]: Loop Invariant [2022-07-13 14:55:30,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,346 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,346 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven [2022-07-13 14:55:30,347 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,347 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[currentRoundingMode,QUANTIFIED] [2022-07-13 14:55:30,347 WARN L418 cessorBacktranslator]: Unfinished backtranslation: Declaration ConstDeclaration not handled for expression ~roundNearestTiesToEven Derived loop invariant: ((\exists currentRoundingMode : FloatRoundingMode :: ~to_fp~LONGDOUBLE(currentRoundingMode, ~Pluszero~LONGDOUBLE()) == zero_log) && (\exists currentRoundingMode : FloatRoundingMode :: x == ~to_fp~LONGDOUBLE(currentRoundingMode, 1.0))) && unknown-currentRoundingMode-unknown == ~roundNearestTiesToEven - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-07-13 14:55:30,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE