./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -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-benchs/filter1.c.v+nlh-reducer.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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:21:53,888 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:53,890 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:53,925 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:53,925 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:53,928 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:53,929 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:53,931 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:53,932 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:53,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:53,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:53,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:53,937 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:53,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:53,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:53,942 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:53,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:53,943 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:53,944 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:53,949 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:53,950 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:53,951 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:53,952 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:53,953 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:53,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:53,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:53,959 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:53,960 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:53,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:53,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:53,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:53,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:53,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:53,963 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:53,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:53,964 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:53,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:53,965 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:53,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:53,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:53,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:53,967 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:21:53,992 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:53,993 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:53,993 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:53,993 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:53,994 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:53,994 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:53,994 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:53,994 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:53,995 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:53,995 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:53,995 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:53,996 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:21:53,996 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:53,996 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:53,996 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:53,996 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:53,996 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:53,997 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:53,997 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:53,997 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:53,997 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:53,997 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:53,997 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:53,997 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:53,997 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:53,998 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:53,998 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:53,998 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:53,998 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:21:53,998 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:21:53,998 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:53,998 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:53,999 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:53,999 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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2022-02-20 16:21:54,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:54,203 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:54,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:54,206 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:54,206 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:54,207 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2022-02-20 16:21:54,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7d5ad69/765a6f1776534bdbb83d8b5543f09aec/FLAG3071364ed [2022-02-20 16:21:54,589 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:54,589 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2022-02-20 16:21:54,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7d5ad69/765a6f1776534bdbb83d8b5543f09aec/FLAG3071364ed [2022-02-20 16:21:55,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a7d5ad69/765a6f1776534bdbb83d8b5543f09aec [2022-02-20 16:21:55,034 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:55,035 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:55,036 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:55,036 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:55,039 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:55,040 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,040 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e009b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55, skipping insertion in model container [2022-02-20 16:21:55,041 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,048 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:55,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:55,239 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-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2022-02-20 16:21:55,254 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-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2022-02-20 16:21:55,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:55,268 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:55,285 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-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2022-02-20 16:21:55,288 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-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2022-02-20 16:21:55,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:55,301 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:55,301 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55 WrapperNode [2022-02-20 16:21:55,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:55,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:55,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:55,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:55,307 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,312 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,327 INFO L137 Inliner]: procedures = 15, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 126 [2022-02-20 16:21:55,328 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:55,328 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:55,328 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:55,328 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:55,333 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,334 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,339 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,341 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,342 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:55,343 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:55,343 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:55,343 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:55,344 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (1/1) ... [2022-02-20 16:21:55,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:55,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:55,365 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-02-20 16:21:55,368 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-02-20 16:21:55,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:21:55,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:55,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:55,450 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:55,451 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:21:55,567 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:21:55,571 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:21:55,571 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:21:55,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:55 BoogieIcfgContainer [2022-02-20 16:21:55,572 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:21:55,573 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:21:55,574 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:21:55,577 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:21:55,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:55" (1/3) ... [2022-02-20 16:21:55,578 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171130c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:55, skipping insertion in model container [2022-02-20 16:21:55,578 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:55" (2/3) ... [2022-02-20 16:21:55,579 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@171130c5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:21:55, skipping insertion in model container [2022-02-20 16:21:55,579 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:55" (3/3) ... [2022-02-20 16:21:55,580 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2022-02-20 16:21:55,583 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:21:55,583 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 16:21:55,645 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:21:55,661 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:21:55,662 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 16:21:55,683 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 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-02-20 16:21:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:55,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:55,689 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:55,689 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:55,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:55,695 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-02-20 16:21:55,701 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:55,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938347854] [2022-02-20 16:21:55,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:55,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:55,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:21:55,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(26, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_129_0~0 := 0;~__tmp_129_1~0 := 0;~__tmp_129_2~0 := 0;~__tmp_112_0~0 := 0;~__return_134~0 := 0; {37#true} is VALID [2022-02-20 16:21:55,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(0);main_~main__S~0#1 := ~convertINTToDOUBLE(0);main_~main__i~0#1 := 0; {37#true} is VALID [2022-02-20 16:21:55,870 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume main_~main__i~0#1 <= 1000000;main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {37#true} is VALID [2022-02-20 16:21:55,870 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__E0~0#1, ~someUnaryDOUBLEoperation(1.0)); {37#true} is VALID [2022-02-20 16:21:55,870 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__E0~0#1, 1.0);main_~main____CPAchecker_TMP_0~0#1 := 1; {39#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1)} is VALID [2022-02-20 16:21:55,871 INFO L290 TraceCheckUtils]: 5: Hoare triple {39#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~0#1| 1)} assume 0 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {37#true} is VALID [2022-02-20 16:21:55,871 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(0 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(0); {37#true} is VALID [2022-02-20 16:21:55,871 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {37#true} is VALID [2022-02-20 16:21:55,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, ~someUnaryDOUBLEoperation(10000.0)); {37#true} is VALID [2022-02-20 16:21:55,872 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume ~someBinaryDOUBLEComparisonOperation(main_~main__S~0#1, 10000.0);main_~main____CPAchecker_TMP_2~0#1 := 1; {40#(not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 0))} is VALID [2022-02-20 16:21:55,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {40#(not (= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| 0))} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {41#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 16:21:55,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {41#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {38#false} is VALID [2022-02-20 16:21:55,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-02-20 16:21:55,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:21:55,874 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:21:55,874 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938347854] [2022-02-20 16:21:55,875 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938347854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:21:55,875 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:21:55,875 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:21:55,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062487315] [2022-02-20 16:21:55,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:21:55,880 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 16:21:55,881 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:21:55,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 16:21:55,894 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:55,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:21:55,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:21:55,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:21:55,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:21:55,914 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 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) Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 16:21:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:56,089 INFO L93 Difference]: Finished difference Result 47 states and 61 transitions. [2022-02-20 16:21:56,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:21:56,089 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2022-02-20 16:21:56,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:21:56,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 16:21:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-02-20 16:21:56,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 16:21:56,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 61 transitions. [2022-02-20 16:21:56,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 61 transitions. [2022-02-20 16:21:56,151 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:21:56,157 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:21:56,158 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:21:56,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:21:56,164 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 45 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:21:56,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 134 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:21:56,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:21:56,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-02-20 16:21:56,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:21:56,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:21:56,194 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:21:56,195 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:21:56,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:56,201 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 16:21:56,201 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 16:21:56,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:56,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:56,203 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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) Second operand 34 states. [2022-02-20 16:21:56,203 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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) Second operand 34 states. [2022-02-20 16:21:56,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:21:56,208 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-02-20 16:21:56,208 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-02-20 16:21:56,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:21:56,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:21:56,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:21:56,209 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:21:56,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:21:56,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 16:21:56,214 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-02-20 16:21:56,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:21:56,215 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 16:21:56,215 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-02-20 16:21:56,215 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:21:56,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:21:56,216 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:21:56,216 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:21:56,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:21:56,217 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:21:56,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:21:56,222 INFO L85 PathProgramCache]: Analyzing trace with hash 845201395, now seen corresponding path program 1 times [2022-02-20 16:21:56,223 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:21:56,223 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032315885] [2022-02-20 16:21:56,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:21:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:21:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:56,244 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:21:56,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:21:56,264 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:21:56,264 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:21:56,265 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-02-20 16:21:56,267 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-02-20 16:21:56,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:21:56,269 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 16:21:56,271 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:21:56,310 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:21:56,310 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: L27 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: L199 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: L33 has no Hoare annotation [2022-02-20 16:21:56,311 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:21:56,312 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:21:56,312 WARN L170 areAnnotationChecker]: L36 has no Hoare annotation [2022-02-20 16:21:56,312 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:21:56,312 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 16:21:56,312 WARN L170 areAnnotationChecker]: L184 has no Hoare annotation [2022-02-20 16:21:56,312 WARN L170 areAnnotationChecker]: L178 has no Hoare annotation [2022-02-20 16:21:56,312 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L172 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L167 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:21:56,313 WARN L170 areAnnotationChecker]: L59 has no Hoare annotation [2022-02-20 16:21:56,314 WARN L170 areAnnotationChecker]: L113 has no Hoare annotation [2022-02-20 16:21:56,314 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:21:56,314 WARN L170 areAnnotationChecker]: L72 has no Hoare annotation [2022-02-20 16:21:56,315 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:21:56,315 WARN L170 areAnnotationChecker]: L76 has no Hoare annotation [2022-02-20 16:21:56,315 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:21:56,315 WARN L170 areAnnotationChecker]: L78 has no Hoare annotation [2022-02-20 16:21:56,315 WARN L170 areAnnotationChecker]: L152 has no Hoare annotation [2022-02-20 16:21:56,315 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:21:56,315 WARN L170 areAnnotationChecker]: L147 has no Hoare annotation [2022-02-20 16:21:56,316 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:21:56,316 WARN L170 areAnnotationChecker]: L86 has no Hoare annotation [2022-02-20 16:21:56,316 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 16:21:56,316 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:21:56,316 WARN L170 areAnnotationChecker]: L92 has no Hoare annotation [2022-02-20 16:21:56,316 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 16:21:56,316 WARN L170 areAnnotationChecker]: L94 has no Hoare annotation [2022-02-20 16:21:56,317 WARN L170 areAnnotationChecker]: L126 has no Hoare annotation [2022-02-20 16:21:56,317 WARN L170 areAnnotationChecker]: L121 has no Hoare annotation [2022-02-20 16:21:56,317 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-02-20 16:21:56,317 WARN L170 areAnnotationChecker]: L103 has no Hoare annotation [2022-02-20 16:21:56,317 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 16:21:56,317 WARN L170 areAnnotationChecker]: L105 has no Hoare annotation [2022-02-20 16:21:56,318 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:21:56,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:21:56 BoogieIcfgContainer [2022-02-20 16:21:56,319 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:21:56,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:21:56,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:21:56,320 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:21:56,321 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:21:55" (3/4) ... [2022-02-20 16:21:56,324 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 16:21:56,324 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:21:56,326 INFO L158 Benchmark]: Toolchain (without parser) took 1289.81ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 69.9MB in the beginning and 102.8MB in the end (delta: -32.8MB). Peak memory consumption was 876.9kB. Max. memory is 16.1GB. [2022-02-20 16:21:56,326 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:56,328 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.65ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 82.7MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:21:56,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.65ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:56,330 INFO L158 Benchmark]: Boogie Preprocessor took 14.37ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 79.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:21:56,331 INFO L158 Benchmark]: RCFGBuilder took 229.55ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 68.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:21:56,331 INFO L158 Benchmark]: TraceAbstraction took 745.25ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 67.6MB in the beginning and 102.8MB in the end (delta: -35.1MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:56,331 INFO L158 Benchmark]: Witness Printer took 3.93ms. Allocated memory is still 142.6MB. Free memory is still 102.8MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:21:56,333 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 85.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 265.65ms. Allocated memory is still 109.1MB. Free memory was 69.7MB in the beginning and 82.7MB in the end (delta: -13.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.65ms. Allocated memory is still 109.1MB. Free memory was 82.7MB in the beginning and 80.7MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 14.37ms. Allocated memory is still 109.1MB. Free memory was 80.7MB in the beginning and 79.5MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 229.55ms. Allocated memory is still 109.1MB. Free memory was 79.5MB in the beginning and 68.1MB in the end (delta: 11.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 745.25ms. Allocated memory was 109.1MB in the beginning and 142.6MB in the end (delta: 33.6MB). Free memory was 67.6MB in the beginning and 102.8MB in the end (delta: -35.1MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.93ms. Allocated memory is still 142.6MB. Free memory is still 102.8MB. 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: 59]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 46, overapproximation of to_real at line 42. Possible FailurePath: [L1] int __return_main; [L13] int __tmp_129_0; [L14] int __tmp_129_1; [L15] int __tmp_129_2; [L16] int __tmp_112_0; [L17] int __return_134; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0] [L20] double main__E0; [L21] double main__E1; [L22] double main__S; [L23] int main__i; [L24] main__E1 = 0 [L25] main__S = 0 [L26] main__i = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__i=0] [L27] COND TRUE main__i <= 1000000 [L29] main__E0 = __VERIFIER_nondet_double() [L30] int main____CPAchecker_TMP_0; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L31] COND TRUE main__E0 >= -1.0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main__E0=49, main__i=0] [L33] COND TRUE main__E0 <= 1.0 [L35] main____CPAchecker_TMP_0 = 1 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main__E0=49, main__i=0] [L36] COND TRUE main____CPAchecker_TMP_0 != 0 [L38] int main____CPAchecker_TMP_1; [L39] main____CPAchecker_TMP_1 = __VERIFIER_nondet_int() [L40] COND TRUE !(main____CPAchecker_TMP_1 == 0) [L42] main__S = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__i=0] [L44] main__E1 = main__E0 [L45] int main____CPAchecker_TMP_2; VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L46] COND FALSE !(main__S >= -10000.0) VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main__E0=49, main__E1=49, main__i=0] [L166] main____CPAchecker_TMP_2 = 0 VAL [__return_134=0, __return_main=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L53] int __tmp_1; [L54] __tmp_1 = main____CPAchecker_TMP_2 [L55] int __VERIFIER_assert__cond; [L56] __VERIFIER_assert__cond = __tmp_1 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L57] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] [L59] reach_error() VAL [__return_134=0, __return_main=0, __tmp_1=0, __tmp_112_0=0, __tmp_129_0=0, __tmp_129_1=0, __tmp_129_2=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=1, main____CPAchecker_TMP_2=0, main__E0=49, main__E1=49, main__i=0] - UnprovableResult [Line: 105]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 34 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 0.6s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 45 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 45 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 89 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 17 IncrementalHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 45 mSDtfsCounter, 17 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=0, InterpolantAutomatonStates: 7, 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, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 26 NumberOfCodeBlocks, 26 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 12 ConstructedInterpolants, 0 QuantifiedInterpolants, 20 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-02-20 16:21:56,356 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 -ea -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-benchs/filter1.c.v+nlh-reducer.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 ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:21:57,922 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:21:57,923 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:21:57,940 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:21:57,941 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:21:57,941 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:21:57,942 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:21:57,943 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:21:57,945 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:21:57,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:21:57,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:21:57,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:21:57,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:21:57,948 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:21:57,948 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:21:57,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:21:57,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:21:57,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:21:57,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:21:57,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:21:57,954 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:21:57,954 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:21:57,955 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:21:57,956 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:21:57,958 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:21:57,958 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:21:57,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:21:57,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:21:57,959 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:21:57,960 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:21:57,960 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:21:57,961 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:21:57,962 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:21:57,962 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:21:57,963 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:21:57,963 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:21:57,964 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:21:57,964 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:21:57,965 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:21:57,965 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:21:57,966 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:21:57,966 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:21:58,012 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:21:58,012 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:21:58,012 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:21:58,012 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:21:58,013 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:21:58,013 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:21:58,013 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:21:58,014 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:21:58,014 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:21:58,014 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:21:58,014 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:21:58,014 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:21:58,014 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:21:58,014 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:21:58,014 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:21:58,015 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:21:58,015 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:58,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:21:58,016 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:21:58,017 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:21:58,017 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:21:58,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:21:58,017 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 -> ae4391defacca69a38cbe50f54517d5a9901ae5aadf26a16d1de8c85a3ebd382 [2022-02-20 16:21:58,285 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:21:58,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:21:58,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:21:58,304 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:21:58,304 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:21:58,305 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2022-02-20 16:21:58,362 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236eace28/2d5daad6893e446293b8e109785c71dd/FLAG56053d3c4 [2022-02-20 16:21:58,709 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:21:58,710 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/filter1.c.v+nlh-reducer.c [2022-02-20 16:21:58,716 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236eace28/2d5daad6893e446293b8e109785c71dd/FLAG56053d3c4 [2022-02-20 16:21:59,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/236eace28/2d5daad6893e446293b8e109785c71dd [2022-02-20 16:21:59,118 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:21:59,127 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:21:59,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:59,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:21:59,130 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:21:59,131 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,132 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c5395e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59, skipping insertion in model container [2022-02-20 16:21:59,133 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,137 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:21:59,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:21:59,284 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-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2022-02-20 16:21:59,291 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-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2022-02-20 16:21:59,312 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:59,340 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:21:59,356 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-benchs/filter1.c.v+nlh-reducer.c[1372,1385] [2022-02-20 16:21:59,359 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-benchs/filter1.c.v+nlh-reducer.c[2411,2424] [2022-02-20 16:21:59,361 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:21:59,370 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:21:59,371 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59 WrapperNode [2022-02-20 16:21:59,371 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:21:59,371 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:59,372 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:21:59,372 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:21:59,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,382 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,396 INFO L137 Inliner]: procedures = 16, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 125 [2022-02-20 16:21:59,397 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:21:59,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:21:59,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:21:59,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:21:59,402 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,402 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,404 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,404 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,408 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,409 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:21:59,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:21:59,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:21:59,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:21:59,413 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (1/1) ... [2022-02-20 16:21:59,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:21:59,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:21:59,446 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-02-20 16:21:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:21:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:21:59,501 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:21:59,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:21:59,479 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-02-20 16:21:59,561 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:21:59,562 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:22:03,884 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:22:03,888 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:22:03,889 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 16:22:03,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:22:03 BoogieIcfgContainer [2022-02-20 16:22:03,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:22:03,891 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:22:03,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:22:03,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:22:03,895 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:21:59" (1/3) ... [2022-02-20 16:22:03,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0d1206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:22:03, skipping insertion in model container [2022-02-20 16:22:03,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:21:59" (2/3) ... [2022-02-20 16:22:03,896 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f0d1206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:22:03, skipping insertion in model container [2022-02-20 16:22:03,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:22:03" (3/3) ... [2022-02-20 16:22:03,900 INFO L111 eAbstractionObserver]: Analyzing ICFG filter1.c.v+nlh-reducer.c [2022-02-20 16:22:03,904 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:22:03,904 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-20 16:22:03,937 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:22:03,945 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:22:03,945 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-20 16:22:03,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 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-02-20 16:22:03,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:22:03,959 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:03,959 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:03,960 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:03,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:03,964 INFO L85 PathProgramCache]: Analyzing trace with hash 775758574, now seen corresponding path program 1 times [2022-02-20 16:22:03,971 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:03,971 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092524893] [2022-02-20 16:22:03,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:03,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:03,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:03,974 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-02-20 16:22:03,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:22:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:04,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:22:04,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:04,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:04,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__tmp_112_0~0 := 0bv32;~__return_134~0 := 0bv32; {37#true} is VALID [2022-02-20 16:22:04,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {37#true} is VALID [2022-02-20 16:22:04,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {37#true} is VALID [2022-02-20 16:22:04,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {37#true} is VALID [2022-02-20 16:22:04,182 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {37#true} is VALID [2022-02-20 16:22:04,183 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {37#true} is VALID [2022-02-20 16:22:04,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {37#true} is VALID [2022-02-20 16:22:04,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {37#true} is VALID [2022-02-20 16:22:04,184 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {37#true} is VALID [2022-02-20 16:22:04,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {37#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {69#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| (_ bv1 32))} is VALID [2022-02-20 16:22:04,186 INFO L290 TraceCheckUtils]: 10: Hoare triple {69#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~0#1| (_ bv1 32))} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {73#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} is VALID [2022-02-20 16:22:04,187 INFO L290 TraceCheckUtils]: 11: Hoare triple {73#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| (_ bv1 32))} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {38#false} is VALID [2022-02-20 16:22:04,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {38#false} assume !false; {38#false} is VALID [2022-02-20 16:22:04,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:04,188 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:04,188 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:04,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092524893] [2022-02-20 16:22:04,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092524893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:04,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:04,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:22:04,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736501455] [2022-02-20 16:22:04,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:04,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-02-20 16:22:04,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:04,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:22:04,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:04,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:22:04,217 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:04,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:22:04,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:22:04,245 INFO L87 Difference]: Start difference. First operand has 34 states, 31 states have (on average 1.5806451612903225) internal successors, (49), 33 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) Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:22:17,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:17,034 INFO L93 Difference]: Finished difference Result 61 states and 83 transitions. [2022-02-20 16:22:17,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:22:17,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-02-20 16:22:17,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:17,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:22:17,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-02-20 16:22:17,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:22:17,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 83 transitions. [2022-02-20 16:22:17,051 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 83 transitions. [2022-02-20 16:22:17,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:17,530 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:22:17,532 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 16:22:17,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:22:17,537 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 29 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:17,538 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 134 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:22:17,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 16:22:17,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 32. [2022-02-20 16:22:17,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:17,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:22:17,586 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:22:17,587 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:22:17,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:17,593 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-02-20 16:22:17,593 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-02-20 16:22:17,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:17,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:17,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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) Second operand 48 states. [2022-02-20 16:22:17,595 INFO L87 Difference]: Start difference. First operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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) Second operand 48 states. [2022-02-20 16:22:17,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:17,599 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-02-20 16:22:17,600 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-02-20 16:22:17,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:17,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:17,601 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:17,601 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 31 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-02-20 16:22:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 40 transitions. [2022-02-20 16:22:17,606 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 40 transitions. Word has length 13 [2022-02-20 16:22:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:17,606 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 40 transitions. [2022-02-20 16:22:17,607 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-02-20 16:22:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 40 transitions. [2022-02-20 16:22:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:22:17,608 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:17,608 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:17,620 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 16:22:17,816 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:17,816 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:17,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:17,817 INFO L85 PathProgramCache]: Analyzing trace with hash 845201395, now seen corresponding path program 1 times [2022-02-20 16:22:17,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:17,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1665847957] [2022-02-20 16:22:17,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:17,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:17,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:17,819 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-02-20 16:22:17,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:22:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:17,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:22:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:17,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:17,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__tmp_112_0~0 := 0bv32;~__return_134~0 := 0bv32; {302#true} is VALID [2022-02-20 16:22:17,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {302#true} is VALID [2022-02-20 16:22:17,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {302#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {302#true} is VALID [2022-02-20 16:22:17,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {302#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {302#true} is VALID [2022-02-20 16:22:17,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {302#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {302#true} is VALID [2022-02-20 16:22:17,928 INFO L290 TraceCheckUtils]: 5: Hoare triple {302#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {302#true} is VALID [2022-02-20 16:22:17,928 INFO L290 TraceCheckUtils]: 6: Hoare triple {302#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {325#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} is VALID [2022-02-20 16:22:17,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {325#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {325#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} is VALID [2022-02-20 16:22:17,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {325#(= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)))} assume !~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {303#false} is VALID [2022-02-20 16:22:17,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {303#false} is VALID [2022-02-20 16:22:17,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {303#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {303#false} is VALID [2022-02-20 16:22:17,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {303#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {303#false} is VALID [2022-02-20 16:22:17,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#false} assume !false; {303#false} is VALID [2022-02-20 16:22:17,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:17,931 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:17,931 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:17,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1665847957] [2022-02-20 16:22:17,932 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1665847957] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:17,932 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:17,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:22:17,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086219710] [2022-02-20 16:22:17,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:17,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-02-20 16:22:17,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:17,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:22:17,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:17,946 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:22:17,947 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:17,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:22:17,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:17,947 INFO L87 Difference]: Start difference. First operand 32 states and 40 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:22:22,777 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:22:25,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:25,078 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-02-20 16:22:25,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:22:25,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 13 [2022-02-20 16:22:25,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:25,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:22:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 16:22:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:22:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 89 transitions. [2022-02-20 16:22:25,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 89 transitions. [2022-02-20 16:22:25,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:25,862 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:22:25,862 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 16:22:25,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:25,863 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 23 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:25,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 40 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 16:22:25,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 16:22:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 38. [2022-02-20 16:22:25,867 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:25,867 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:25,867 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:25,868 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:25,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:25,869 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-02-20 16:22:25,869 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-02-20 16:22:25,870 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:25,870 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:25,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:22:25,870 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 16:22:25,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:25,877 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2022-02-20 16:22:25,877 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2022-02-20 16:22:25,879 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:25,879 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:25,879 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:25,879 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:25,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:25,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-02-20 16:22:25,883 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 13 [2022-02-20 16:22:25,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:25,883 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-02-20 16:22:25,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-02-20 16:22:25,884 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 16:22:25,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:22:25,884 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:25,884 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:25,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 16:22:26,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:26,085 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:26,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1168948157, now seen corresponding path program 1 times [2022-02-20 16:22:26,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:26,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [467464605] [2022-02-20 16:22:26,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:26,087 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:26,087 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:26,089 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-02-20 16:22:26,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:22:26,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:26,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:22:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:26,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:26,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {591#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__tmp_112_0~0 := 0bv32;~__return_134~0 := 0bv32; {596#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:26,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {600#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:26,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {600#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {600#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:26,997 INFO L290 TraceCheckUtils]: 3: Hoare triple {600#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {607#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:26,997 INFO L290 TraceCheckUtils]: 4: Hoare triple {607#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {611#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:26,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {611#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:27,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !!(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~fp.sub~DOUBLE(currentRoundingMode, ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.999), main_~main__S~0#1), main_~main__E0~0#1), main_~main__E1~0#1); {618#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:27,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {618#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {618#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:27,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {618#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {592#false} is VALID [2022-02-20 16:22:27,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {592#false} is VALID [2022-02-20 16:22:27,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {592#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {592#false} is VALID [2022-02-20 16:22:27,010 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {592#false} is VALID [2022-02-20 16:22:27,010 INFO L290 TraceCheckUtils]: 12: Hoare triple {592#false} assume !false; {592#false} is VALID [2022-02-20 16:22:27,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:27,010 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:27,010 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:27,011 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [467464605] [2022-02-20 16:22:27,011 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [467464605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:27,011 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:27,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:22:27,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535329830] [2022-02-20 16:22:27,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:27,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-02-20 16:22:27,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:27,012 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-02-20 16:22:27,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:27,379 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:22:27,379 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:27,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:22:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:27,380 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-02-20 16:22:33,762 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-02-20 16:22:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:34,080 INFO L93 Difference]: Finished difference Result 61 states and 74 transitions. [2022-02-20 16:22:34,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:22:34,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-02-20 16:22:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:34,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-02-20 16:22:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-02-20 16:22:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-02-20 16:22:34,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-02-20 16:22:34,082 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-02-20 16:22:34,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:34,967 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:22:34,967 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:22:34,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:34,968 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 9 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:34,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 72 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 53 Invalid, 1 Unknown, 3 Unchecked, 3.9s Time] [2022-02-20 16:22:34,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:22:34,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-02-20 16:22:34,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:34,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-02-20 16:22:34,971 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-02-20 16:22:34,971 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-02-20 16:22:34,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:34,972 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:22:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:22:34,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:34,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:34,973 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 38 states. [2022-02-20 16:22:34,973 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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 38 states. [2022-02-20 16:22:34,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:34,974 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:22:34,974 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:22:34,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:34,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:34,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:34,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:34,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 36 states have (on average 1.25) internal successors, (45), 37 states have internal predecessors, (45), 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-02-20 16:22:34,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-02-20 16:22:34,975 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 13 [2022-02-20 16:22:34,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:34,976 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-02-20 16:22:34,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 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-02-20 16:22:34,976 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:22:34,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:22:34,976 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:34,976 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:35,005 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:35,190 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:35,190 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:35,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:35,191 INFO L85 PathProgramCache]: Analyzing trace with hash 327501055, now seen corresponding path program 1 times [2022-02-20 16:22:35,191 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:35,191 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [781473668] [2022-02-20 16:22:35,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:35,191 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:35,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:35,199 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-02-20 16:22:35,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:22:35,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:35,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 41 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 16:22:35,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:35,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:36,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {844#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__tmp_112_0~0 := 0bv32;~__return_134~0 := 0bv32; {849#(= currentRoundingMode roundNearestTiesToEven)} is VALID [2022-02-20 16:22:36,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {849#(= currentRoundingMode roundNearestTiesToEven)} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {853#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,179 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {853#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,179 INFO L290 TraceCheckUtils]: 3: Hoare triple {853#(and (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {860#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,180 INFO L290 TraceCheckUtils]: 4: Hoare triple {860#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {864#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,180 INFO L290 TraceCheckUtils]: 5: Hoare triple {864#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {864#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#(and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (= |ULTIMATE.start_main_~main__S~0#1| ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) (= ((_ to_fp 11 53) currentRoundingMode (_ bv0 32)) |ULTIMATE.start_main_~main__E1~0#1|) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= currentRoundingMode roundNearestTiesToEven))} assume !!(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~fp.sub~DOUBLE(currentRoundingMode, ~fp.add~DOUBLE(currentRoundingMode, ~fp.mul~DOUBLE(currentRoundingMode, ~to_fp~DOUBLE(currentRoundingMode, 0.999), main_~main__S~0#1), main_~main__E0~0#1), main_~main__E1~0#1); {871#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {871#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {871#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {871#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {871#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} is VALID [2022-02-20 16:22:36,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {871#(and (exists ((|ULTIMATE.start_main_~main__E0~0#1| (_ FloatingPoint 11 53))) (and (fp.geq |ULTIMATE.start_main_~main__E0~0#1| (fp.neg ((_ to_fp 11 53) currentRoundingMode 1.0))) (fp.leq |ULTIMATE.start_main_~main__E0~0#1| ((_ to_fp 11 53) currentRoundingMode 1.0)) (= (fp.sub currentRoundingMode (fp.add currentRoundingMode (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (/ 999.0 1000.0)) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__E0~0#1|) ((_ to_fp 11 53) currentRoundingMode (_ bv0 32))) |ULTIMATE.start_main_~main__S~0#1|))) (= currentRoundingMode roundNearestTiesToEven))} assume !~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0)); {845#false} is VALID [2022-02-20 16:22:36,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {845#false} main_~main____CPAchecker_TMP_2~0#1 := 0bv32; {845#false} is VALID [2022-02-20 16:22:36,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#false} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {845#false} is VALID [2022-02-20 16:22:36,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {845#false} assume 0bv32 == main_~__VERIFIER_assert__cond~0#1; {845#false} is VALID [2022-02-20 16:22:36,193 INFO L290 TraceCheckUtils]: 13: Hoare triple {845#false} assume !false; {845#false} is VALID [2022-02-20 16:22:36,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:36,194 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:36,194 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:36,194 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [781473668] [2022-02-20 16:22:36,194 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [781473668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:36,194 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:36,194 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:22:36,194 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462122217] [2022-02-20 16:22:36,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:36,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-02-20 16:22:36,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:36,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-02-20 16:22:36,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:36,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 16:22:36,613 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:36,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 16:22:36,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:36,613 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-02-20 16:22:42,270 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 16:22:42,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:42,452 INFO L93 Difference]: Finished difference Result 56 states and 68 transitions. [2022-02-20 16:22:42,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:22:42,452 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 14 [2022-02-20 16:22:42,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-02-20 16:22:42,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-02-20 16:22:42,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-02-20 16:22:42,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 60 transitions. [2022-02-20 16:22:42,454 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 60 transitions. [2022-02-20 16:22:43,105 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:43,108 INFO L225 Difference]: With dead ends: 56 [2022-02-20 16:22:43,108 INFO L226 Difference]: Without dead ends: 33 [2022-02-20 16:22:43,108 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:22:43,109 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 4 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 4 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:43,109 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 48 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 32 Invalid, 1 Unknown, 4 Unchecked, 3.3s Time] [2022-02-20 16:22:43,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-20 16:22:43,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-02-20 16:22:43,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:43,111 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:43,111 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:43,112 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:43,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:43,112 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 16:22:43,112 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 16:22:43,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:43,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:43,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:22:43,113 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 33 states. [2022-02-20 16:22:43,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:43,114 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-02-20 16:22:43,114 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-02-20 16:22:43,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:43,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:43,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:43,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:43,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:43,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:22:43,116 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 14 [2022-02-20 16:22:43,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:43,116 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:22:43,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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-02-20 16:22:43,116 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:22:43,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:22:43,117 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:43,117 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:43,134 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:43,329 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:43,329 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:43,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash 135134655, now seen corresponding path program 1 times [2022-02-20 16:22:43,330 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:43,330 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1724465803] [2022-02-20 16:22:43,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:43,330 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:43,330 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:43,331 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-02-20 16:22:43,332 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:22:43,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:43,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 16:22:43,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:43,379 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:43,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {1072#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__tmp_112_0~0 := 0bv32;~__return_134~0 := 0bv32; {1072#true} is VALID [2022-02-20 16:22:43,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {1072#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {1072#true} is VALID [2022-02-20 16:22:43,445 INFO L290 TraceCheckUtils]: 2: Hoare triple {1072#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {1072#true} is VALID [2022-02-20 16:22:43,445 INFO L290 TraceCheckUtils]: 3: Hoare triple {1072#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {1072#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 5: Hoare triple {1072#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 6: Hoare triple {1072#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {1072#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {1072#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {1072#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 10: Hoare triple {1072#true} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1072#true} is VALID [2022-02-20 16:22:43,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {1072#true} assume !(0bv32 == main_~__VERIFIER_assert__cond~0#1);~__tmp_129_0~0 := main_~main____CPAchecker_TMP_0~0#1;~__tmp_129_1~0 := main_~main____CPAchecker_TMP_1~0#1;~__tmp_129_2~0 := main_~main____CPAchecker_TMP_2~0#1; {1072#true} is VALID [2022-02-20 16:22:43,448 INFO L290 TraceCheckUtils]: 12: Hoare triple {1072#true} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_129_0~0;main_~main____CPAchecker_TMP_1~0#1 := ~__tmp_129_1~0;main_~main____CPAchecker_TMP_2~0#1 := ~__tmp_129_2~0;main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {1072#true} is VALID [2022-02-20 16:22:43,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {1072#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~main____CPAchecker_TMP_0~1#1; {1072#true} is VALID [2022-02-20 16:22:43,449 INFO L290 TraceCheckUtils]: 14: Hoare triple {1072#true} assume !~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1072#true} is VALID [2022-02-20 16:22:43,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {1072#true} main_~main____CPAchecker_TMP_0~1#1 := 0bv32; {1122#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| (_ bv0 32))} is VALID [2022-02-20 16:22:43,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {1122#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_0~1#1| (_ bv0 32))} assume 0bv32 != main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;main_~main____CPAchecker_TMP_1~1#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1073#false} is VALID [2022-02-20 16:22:43,451 INFO L290 TraceCheckUtils]: 17: Hoare triple {1073#false} assume !(0bv32 == main_~main____CPAchecker_TMP_1~1#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1073#false} is VALID [2022-02-20 16:22:43,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {1073#false} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~1#1; {1073#false} is VALID [2022-02-20 16:22:43,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {1073#false} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1073#false} is VALID [2022-02-20 16:22:43,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {1073#false} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~1#1 := 1bv32; {1073#false} is VALID [2022-02-20 16:22:43,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {1073#false} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := main_~main____CPAchecker_TMP_2~1#1;havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1073#false} is VALID [2022-02-20 16:22:43,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {1073#false} assume 0bv32 == main_~__VERIFIER_assert__cond~1#1; {1073#false} is VALID [2022-02-20 16:22:43,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {1073#false} assume !false; {1073#false} is VALID [2022-02-20 16:22:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:43,452 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:43,452 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:43,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1724465803] [2022-02-20 16:22:43,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1724465803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:43,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:43,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:22:43,453 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929605254] [2022-02-20 16:22:43,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:43,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-02-20 16:22:43,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:43,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-02-20 16:22:43,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:43,476 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:22:43,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:43,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:22:43,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:43,478 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-02-20 16:22:51,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:51,912 INFO L93 Difference]: Finished difference Result 49 states and 60 transitions. [2022-02-20 16:22:51,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:22:51,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-02-20 16:22:51,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:22:51,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-02-20 16:22:51,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:22:51,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-02-20 16:22:51,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 54 transitions. [2022-02-20 16:22:51,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 54 transitions. [2022-02-20 16:22:52,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:52,397 INFO L225 Difference]: With dead ends: 49 [2022-02-20 16:22:52,397 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:22:52,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:22:52,398 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:22:52,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 60 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:22:52,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:22:52,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:22:52,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:22:52,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:52,403 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:52,403 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:52,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:52,403 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:22:52,404 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:52,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:52,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:52,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:22:52,404 INFO L87 Difference]: Start difference. First operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 29 states. [2022-02-20 16:22:52,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:22:52,405 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:22:52,405 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:52,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:22:52,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:22:52,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:22:52,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:22:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:22:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-02-20 16:22:52,407 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2022-02-20 16:22:52,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:22:52,407 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-02-20 16:22:52,408 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 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-02-20 16:22:52,408 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:22:52,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:22:52,414 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:22:52,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:22:52,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:22:52,622 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:22:52,622 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:22:52,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:22:52,623 INFO L85 PathProgramCache]: Analyzing trace with hash -327957724, now seen corresponding path program 1 times [2022-02-20 16:22:52,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:22:52,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422878030] [2022-02-20 16:22:52,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:22:52,623 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:22:52,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:22:52,625 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-02-20 16:22:52,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:22:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:52,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:22:52,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:22:52,674 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:22:52,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {1307#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(26bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32);~__return_main~0 := 0bv32;~__tmp_129_0~0 := 0bv32;~__tmp_129_1~0 := 0bv32;~__tmp_129_2~0 := 0bv32;~__tmp_112_0~0 := 0bv32;~__return_134~0 := 0bv32; {1307#true} is VALID [2022-02-20 16:22:52,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {1307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_~__tmp_2~0#1, main_~__VERIFIER_assert__cond~1#1, main_~main____CPAchecker_TMP_2~1#1, main_~main____CPAchecker_TMP_1~1#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_2~0#1, main_~main____CPAchecker_TMP_1~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__E0~0#1, main_~main__E1~0#1, main_~main__S~0#1, main_~main__i~0#1;havoc main_~main__E0~0#1;havoc main_~main__E1~0#1;havoc main_~main__S~0#1;havoc main_~main__i~0#1;main_~main__E1~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32);main_~main__i~0#1 := 0bv32; {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {1307#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~main____CPAchecker_TMP_0~0#1; {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {1307#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 4: Hoare triple {1307#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~0#1 := 1bv32; {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 5: Hoare triple {1307#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~0#1;havoc main_~main____CPAchecker_TMP_1~0#1;main_~main____CPAchecker_TMP_1~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 6: Hoare triple {1307#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~0#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 7: Hoare triple {1307#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~0#1; {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 8: Hoare triple {1307#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {1307#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~0#1 := 1bv32; {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {1307#true} havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := main_~main____CPAchecker_TMP_2~0#1;havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {1307#true} is VALID [2022-02-20 16:22:52,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {1307#true} assume !(0bv32 == main_~__VERIFIER_assert__cond~0#1);~__tmp_129_0~0 := main_~main____CPAchecker_TMP_0~0#1;~__tmp_129_1~0 := main_~main____CPAchecker_TMP_1~0#1;~__tmp_129_2~0 := main_~main____CPAchecker_TMP_2~0#1; {1307#true} is VALID [2022-02-20 16:22:52,762 INFO L290 TraceCheckUtils]: 12: Hoare triple {1307#true} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_129_0~0;main_~main____CPAchecker_TMP_1~0#1 := ~__tmp_129_1~0;main_~main____CPAchecker_TMP_2~0#1 := ~__tmp_129_2~0;main_~main__i~0#1 := ~bvadd32(1bv32, main_~main__i~0#1); {1307#true} is VALID [2022-02-20 16:22:52,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {1307#true} assume ~bvsle32(main_~main__i~0#1, 1000000bv32);main_~main__E0~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~main____CPAchecker_TMP_0~1#1; {1307#true} is VALID [2022-02-20 16:22:52,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {1307#true} assume ~fp.geq~DOUBLE(main_~main__E0~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 1.0))); {1307#true} is VALID [2022-02-20 16:22:52,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {1307#true} assume ~fp.leq~DOUBLE(main_~main__E0~0#1, ~to_fp~DOUBLE(currentRoundingMode, 1.0));main_~main____CPAchecker_TMP_0~1#1 := 1bv32; {1307#true} is VALID [2022-02-20 16:22:52,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {1307#true} assume 0bv32 != main_~main____CPAchecker_TMP_0~1#1;havoc main_~main____CPAchecker_TMP_1~1#1;main_~main____CPAchecker_TMP_1~1#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1; {1307#true} is VALID [2022-02-20 16:22:52,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {1307#true} assume !(0bv32 == main_~main____CPAchecker_TMP_1~1#1);main_~main__S~0#1 := ~convertINTToDOUBLE(currentRoundingMode, 0bv32); {1307#true} is VALID [2022-02-20 16:22:52,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1307#true} main_~main__E1~0#1 := main_~main__E0~0#1;havoc main_~main____CPAchecker_TMP_2~1#1; {1307#true} is VALID [2022-02-20 16:22:52,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {1307#true} assume ~fp.geq~DOUBLE(main_~main__S~0#1, ~fp.neg~DOUBLE(~to_fp~DOUBLE(currentRoundingMode, 10000.0))); {1307#true} is VALID [2022-02-20 16:22:52,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {1307#true} assume ~fp.leq~DOUBLE(main_~main__S~0#1, ~to_fp~DOUBLE(currentRoundingMode, 10000.0));main_~main____CPAchecker_TMP_2~1#1 := 1bv32; {1372#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~1#1| (_ bv1 32))} is VALID [2022-02-20 16:22:52,763 INFO L290 TraceCheckUtils]: 21: Hoare triple {1372#(= |ULTIMATE.start_main_~main____CPAchecker_TMP_2~1#1| (_ bv1 32))} havoc main_~__tmp_2~0#1;main_~__tmp_2~0#1 := main_~main____CPAchecker_TMP_2~1#1;havoc main_~__VERIFIER_assert__cond~1#1;main_~__VERIFIER_assert__cond~1#1 := main_~__tmp_2~0#1; {1376#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| (_ bv1 32))} is VALID [2022-02-20 16:22:52,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {1376#(= |ULTIMATE.start_main_~__VERIFIER_assert__cond~1#1| (_ bv1 32))} assume 0bv32 == main_~__VERIFIER_assert__cond~1#1; {1308#false} is VALID [2022-02-20 16:22:52,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {1308#false} assume !false; {1308#false} is VALID [2022-02-20 16:22:52,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:22:52,764 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:22:52,764 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:22:52,764 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422878030] [2022-02-20 16:22:52,764 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422878030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:22:52,764 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:22:52,764 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:22:52,765 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447890032] [2022-02-20 16:22:52,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:22:52,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-02-20 16:22:52,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:22:52,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-02-20 16:22:52,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:22:52,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:22:52,785 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:22:52,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:22:52,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:22:52,785 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-02-20 16:23:07,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:07,629 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-02-20 16:23:07,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:23:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-02-20 16:23:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:23:07,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-02-20 16:23:07,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-20 16:23:07,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-02-20 16:23:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-20 16:23:07,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-02-20 16:23:08,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:23:08,145 INFO L225 Difference]: With dead ends: 48 [2022-02-20 16:23:08,145 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 16:23:08,146 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:23:08,146 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:23:08,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 94 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:23:08,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 16:23:08,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 31. [2022-02-20 16:23:08,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:23:08,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:08,149 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:08,149 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:08,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:08,149 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-02-20 16:23:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-02-20 16:23:08,150 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:08,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:08,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 16:23:08,150 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 46 states. [2022-02-20 16:23:08,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:23:08,151 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-02-20 16:23:08,151 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-02-20 16:23:08,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:23:08,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:23:08,152 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:23:08,152 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:23:08,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:23:08,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-02-20 16:23:08,153 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 24 [2022-02-20 16:23:08,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:23:08,153 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-02-20 16:23:08,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 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-02-20 16:23:08,153 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 16:23:08,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:23:08,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:23:08,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:23:08,162 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:23:08,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:23:08,362 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:23:08,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:23:08,362 INFO L85 PathProgramCache]: Analyzing trace with hash 401808482, now seen corresponding path program 1 times [2022-02-20 16:23:08,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:23:08,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288281776] [2022-02-20 16:23:08,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:23:08,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:23:08,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:23:08,364 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-02-20 16:23:08,364 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:23:08,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:08,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 16:23:10,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:23:10,476 INFO L286 TraceCheckSpWp]: Computing forward predicates...