./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.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 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 16:11:16,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 16:11:16,286 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 16:11:16,339 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 16:11:16,340 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 16:11:16,341 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 16:11:16,343 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 16:11:16,345 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 16:11:16,346 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 16:11:16,351 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 16:11:16,351 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 16:11:16,353 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 16:11:16,354 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 16:11:16,355 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 16:11:16,356 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 16:11:16,359 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 16:11:16,360 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 16:11:16,361 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 16:11:16,362 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 16:11:16,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 16:11:16,369 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 16:11:16,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 16:11:16,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 16:11:16,371 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 16:11:16,373 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 16:11:16,379 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 16:11:16,380 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 16:11:16,380 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 16:11:16,381 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 16:11:16,381 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 16:11:16,382 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 16:11:16,383 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 16:11:16,384 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 16:11:16,385 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 16:11:16,385 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 16:11:16,386 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 16:11:16,386 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 16:11:16,387 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 16:11:16,387 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 16:11:16,387 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 16:11:16,388 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 16:11:16,389 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 16:11:16,390 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 16:11:16,420 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 16:11:16,420 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 16:11:16,421 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 16:11:16,421 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 16:11:16,421 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 16:11:16,422 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 16:11:16,422 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 16:11:16,422 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 16:11:16,423 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 16:11:16,423 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 16:11:16,424 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 16:11:16,424 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 16:11:16,424 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 16:11:16,424 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 16:11:16,424 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 16:11:16,424 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 16:11:16,425 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 16:11:16,425 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 16:11:16,425 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 16:11:16,425 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 16:11:16,425 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 16:11:16,425 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 16:11:16,426 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 16:11:16,426 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 16:11:16,426 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:11:16,426 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 16:11:16,426 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 16:11:16,427 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 16:11:16,427 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 16:11:16,427 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 16:11:16,427 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 16:11:16,427 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 16:11:16,428 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 16:11:16,428 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 -> 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d [2022-07-22 16:11:16,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 16:11:16,699 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 16:11:16,702 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 16:11:16,703 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 16:11:16,707 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 16:11:16,708 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-22 16:11:16,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb2437ad/5d99086741464c13ae08940076d27eed/FLAGe5e3817bd [2022-07-22 16:11:17,131 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 16:11:17,132 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-22 16:11:17,137 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb2437ad/5d99086741464c13ae08940076d27eed/FLAGe5e3817bd [2022-07-22 16:11:17,147 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bfb2437ad/5d99086741464c13ae08940076d27eed [2022-07-22 16:11:17,149 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 16:11:17,150 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 16:11:17,151 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 16:11:17,151 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 16:11:17,155 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 16:11:17,155 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,156 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63da6a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17, skipping insertion in model container [2022-07-22 16:11:17,156 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,164 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 16:11:17,175 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 16:11:17,316 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/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-22 16:11:17,329 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:11:17,336 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 16:11:17,346 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/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-22 16:11:17,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:11:17,361 INFO L208 MainTranslator]: Completed translation [2022-07-22 16:11:17,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17 WrapperNode [2022-07-22 16:11:17,361 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 16:11:17,363 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 16:11:17,363 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 16:11:17,363 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 16:11:17,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,375 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,391 INFO L137 Inliner]: procedures = 14, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 33 [2022-07-22 16:11:17,392 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 16:11:17,393 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 16:11:17,393 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 16:11:17,394 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 16:11:17,400 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,405 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,410 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,414 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,416 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,417 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,423 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 16:11:17,424 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 16:11:17,425 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 16:11:17,425 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 16:11:17,426 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (1/1) ... [2022-07-22 16:11:17,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:11:17,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:11:17,454 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 16:11:17,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 16:11:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 16:11:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 16:11:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 16:11:17,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 16:11:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 16:11:17,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 16:11:17,545 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 16:11:17,546 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 16:11:17,615 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 16:11:17,620 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 16:11:17,620 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 16:11:17,622 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:11:17 BoogieIcfgContainer [2022-07-22 16:11:17,622 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 16:11:17,624 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 16:11:17,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 16:11:17,627 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 16:11:17,627 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 04:11:17" (1/3) ... [2022-07-22 16:11:17,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cda7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:11:17, skipping insertion in model container [2022-07-22 16:11:17,628 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:17" (2/3) ... [2022-07-22 16:11:17,628 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26cda7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:11:17, skipping insertion in model container [2022-07-22 16:11:17,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:11:17" (3/3) ... [2022-07-22 16:11:17,630 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound5.c [2022-07-22 16:11:17,643 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 16:11:17,643 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 16:11:17,685 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 16:11:17,691 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3dcb6bea, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@247ff302 [2022-07-22 16:11:17,692 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 16:11:17,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:11:17,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 16:11:17,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:11:17,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:11:17,702 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:11:17,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:11:17,706 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-07-22 16:11:17,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:11:17,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475305799] [2022-07-22 16:11:17,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:11:17,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:11:17,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:11:17,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:11:17,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 16:11:17,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475305799] [2022-07-22 16:11:17,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475305799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:11:17,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:11:17,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 16:11:17,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664218744] [2022-07-22 16:11:17,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:11:17,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 16:11:17,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 16:11:17,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 16:11:17,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 16:11:17,841 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:11:17,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:11:17,856 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-22 16:11:17,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 16:11:17,858 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 16:11:17,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:11:17,863 INFO L225 Difference]: With dead ends: 33 [2022-07-22 16:11:17,864 INFO L226 Difference]: Without dead ends: 14 [2022-07-22 16:11:17,866 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 16:11:17,869 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 16:11:17,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 16:11:17,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-22 16:11:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-22 16:11:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 16:11:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-22 16:11:17,920 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-07-22 16:11:17,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:11:17,920 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-22 16:11:17,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:11:17,920 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-22 16:11:17,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 16:11:17,921 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:11:17,921 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:11:17,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 16:11:17,922 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:11:17,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:11:17,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-07-22 16:11:17,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 16:11:17,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000523885] [2022-07-22 16:11:17,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:11:17,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 16:11:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 16:11:17,944 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 16:11:17,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 16:11:17,997 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 16:11:17,997 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 16:11:17,999 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 16:11:18,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 16:11:18,007 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1] [2022-07-22 16:11:18,011 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 16:11:18,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 04:11:18 BoogieIcfgContainer [2022-07-22 16:11:18,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 16:11:18,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 16:11:18,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 16:11:18,037 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 16:11:18,038 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:11:17" (3/4) ... [2022-07-22 16:11:18,041 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 16:11:18,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 16:11:18,043 INFO L158 Benchmark]: Toolchain (without parser) took 892.15ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 65.0MB in the beginning and 89.5MB in the end (delta: -24.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:18,043 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:18,047 INFO L158 Benchmark]: CACSL2BoogieTranslator took 210.62ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 64.7MB in the beginning and 93.4MB in the end (delta: -28.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 16:11:18,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.57ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 92.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 16:11:18,050 INFO L158 Benchmark]: Boogie Preprocessor took 30.10ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 91.2MB in the end (delta: 894.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:18,051 INFO L158 Benchmark]: RCFGBuilder took 197.88ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 82.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 16:11:18,051 INFO L158 Benchmark]: TraceAbstraction took 412.56ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 90.1MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:18,052 INFO L158 Benchmark]: Witness Printer took 4.49ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 89.5MB in the end (delta: 594.5kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 16:11:18,058 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory was 51.2MB in the beginning and 51.1MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 210.62ms. Allocated memory was 92.3MB in the beginning and 117.4MB in the end (delta: 25.2MB). Free memory was 64.7MB in the beginning and 93.4MB in the end (delta: -28.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.57ms. Allocated memory is still 117.4MB. Free memory was 93.4MB in the beginning and 92.1MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.10ms. Allocated memory is still 117.4MB. Free memory was 92.1MB in the beginning and 91.2MB in the end (delta: 894.3kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 197.88ms. Allocated memory is still 117.4MB. Free memory was 90.8MB in the beginning and 82.4MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 412.56ms. Allocated memory is still 117.4MB. Free memory was 81.6MB in the beginning and 90.1MB in the end (delta: -8.4MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 4.49ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 89.5MB in the end (delta: 594.5kB). 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: 19]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of to_int at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 28, overapproximation of someBinaryArithmeticDOUBLEoperation at line 29. Possible FailurePath: [L25] int r; [L26] double a, x; [L27] a = __VERIFIER_nondet_double() [L28] CALL assume_abort_if_not(a>=0 && a<=5) [L14] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(a>=0 && a<=5) [L29] x = a / 2.0 [L30] r = 0 VAL [r=0] [L32] COND TRUE 1 VAL [r=0] [L33] CALL __VERIFIER_assert((int)(r*r - a - r + 2*x) == 0) VAL [\old(cond)=0] [L17] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L19] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.3s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 19 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 19 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.0s InterpolantComputationTime, 18 NumberOfCodeBlocks, 18 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 8 ConstructedInterpolants, 0 QuantifiedInterpolants, 8 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-22 16:11:18,096 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.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 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 16:11:20,024 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 16:11:20,027 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 16:11:20,072 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 16:11:20,073 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 16:11:20,074 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 16:11:20,077 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 16:11:20,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 16:11:20,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 16:11:20,086 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 16:11:20,087 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 16:11:20,089 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 16:11:20,089 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 16:11:20,091 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 16:11:20,092 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 16:11:20,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 16:11:20,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 16:11:20,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 16:11:20,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 16:11:20,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 16:11:20,107 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 16:11:20,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 16:11:20,110 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 16:11:20,111 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 16:11:20,112 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 16:11:20,119 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 16:11:20,119 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 16:11:20,120 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 16:11:20,120 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 16:11:20,121 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 16:11:20,122 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 16:11:20,122 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 16:11:20,123 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 16:11:20,124 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 16:11:20,125 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 16:11:20,126 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 16:11:20,126 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 16:11:20,127 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 16:11:20,127 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 16:11:20,127 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 16:11:20,128 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 16:11:20,129 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 16:11:20,137 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 16:11:20,169 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 16:11:20,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 16:11:20,170 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 16:11:20,170 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 16:11:20,171 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 16:11:20,171 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 16:11:20,172 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 16:11:20,172 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 16:11:20,172 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 16:11:20,173 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 16:11:20,173 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 16:11:20,173 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 16:11:20,173 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 16:11:20,174 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 16:11:20,174 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 16:11:20,174 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 16:11:20,174 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 16:11:20,175 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 16:11:20,175 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 16:11:20,175 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 16:11:20,175 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 16:11:20,175 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 16:11:20,175 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 16:11:20,176 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 16:11:20,176 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 16:11:20,176 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 16:11:20,176 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:11:20,176 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 16:11:20,177 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 16:11:20,177 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 16:11:20,177 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 16:11:20,177 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 16:11:20,177 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 16:11:20,178 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 16:11:20,178 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 16:11:20,178 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 16:11:20,178 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 -> 6437fdc3c0b95eb5fb3a7e28606efb50e2431074b1de5f5cf4c718827adac36d [2022-07-22 16:11:20,505 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 16:11:20,526 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 16:11:20,529 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 16:11:20,530 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 16:11:20,535 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 16:11:20,537 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-22 16:11:20,597 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60b1fbee/eb6dcea8ab92404aa7d9661a3003da18/FLAG450ccf7ef [2022-07-22 16:11:21,004 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 16:11:21,005 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/freire1_valuebound5.c [2022-07-22 16:11:21,012 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60b1fbee/eb6dcea8ab92404aa7d9661a3003da18/FLAG450ccf7ef [2022-07-22 16:11:21,023 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d60b1fbee/eb6dcea8ab92404aa7d9661a3003da18 [2022-07-22 16:11:21,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 16:11:21,026 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 16:11:21,027 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 16:11:21,027 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 16:11:21,030 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 16:11:21,031 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,032 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ed7706d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21, skipping insertion in model container [2022-07-22 16:11:21,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,038 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 16:11:21,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 16:11:21,180 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/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-22 16:11:21,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:11:21,208 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 16:11:21,256 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/nla-digbench-scaling/freire1_valuebound5.c[712,725] [2022-07-22 16:11:21,260 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 16:11:21,279 INFO L208 MainTranslator]: Completed translation [2022-07-22 16:11:21,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21 WrapperNode [2022-07-22 16:11:21,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 16:11:21,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 16:11:21,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 16:11:21,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 16:11:21,287 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,294 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,308 INFO L137 Inliner]: procedures = 15, calls = 10, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 34 [2022-07-22 16:11:21,308 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 16:11:21,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 16:11:21,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 16:11:21,309 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 16:11:21,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,318 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,318 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,326 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,328 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,330 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 16:11:21,331 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 16:11:21,331 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 16:11:21,331 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 16:11:21,332 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (1/1) ... [2022-07-22 16:11:21,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 16:11:21,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 16:11:21,361 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-22 16:11:21,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-22 16:11:21,395 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 16:11:21,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 16:11:21,395 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 16:11:21,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 16:11:21,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-22 16:11:21,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-22 16:11:21,459 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 16:11:21,461 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 16:11:22,007 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 16:11:22,012 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 16:11:22,012 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-22 16:11:22,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:11:22 BoogieIcfgContainer [2022-07-22 16:11:22,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 16:11:22,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 16:11:22,016 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 16:11:22,018 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 16:11:22,018 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 04:11:21" (1/3) ... [2022-07-22 16:11:22,019 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb8c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:11:22, skipping insertion in model container [2022-07-22 16:11:22,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 04:11:21" (2/3) ... [2022-07-22 16:11:22,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7fb8c9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 04:11:22, skipping insertion in model container [2022-07-22 16:11:22,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 04:11:22" (3/3) ... [2022-07-22 16:11:22,021 INFO L111 eAbstractionObserver]: Analyzing ICFG freire1_valuebound5.c [2022-07-22 16:11:22,033 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 16:11:22,034 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 16:11:22,084 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 16:11:22,092 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@49aee504, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@61e1fe9e [2022-07-22 16:11:22,093 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 16:11:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:11:22,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 16:11:22,114 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:11:22,114 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:11:22,115 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:11:22,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:11:22,120 INFO L85 PathProgramCache]: Analyzing trace with hash -589467074, now seen corresponding path program 1 times [2022-07-22 16:11:22,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:11:22,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1622227217] [2022-07-22 16:11:22,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:11:22,130 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:11:22,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:11:22,133 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:11:22,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-22 16:11:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:11:22,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-22 16:11:22,462 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:11:22,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:11:22,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 16:11:22,485 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:11:22,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1622227217] [2022-07-22 16:11:22,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1622227217] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:11:22,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:11:22,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-22 16:11:22,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218697464] [2022-07-22 16:11:22,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:11:22,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-22 16:11:22,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:11:22,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-22 16:11:22,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 16:11:22,527 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 14 states have internal predecessors, (19), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:11:22,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:11:22,544 INFO L93 Difference]: Finished difference Result 33 states and 44 transitions. [2022-07-22 16:11:22,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-22 16:11:22,547 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 16:11:22,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:11:22,552 INFO L225 Difference]: With dead ends: 33 [2022-07-22 16:11:22,553 INFO L226 Difference]: Without dead ends: 14 [2022-07-22 16:11:22,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-22 16:11:22,562 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 16:11:22,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 16:11:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-07-22 16:11:22,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-07-22 16:11:22,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 11 states have internal predecessors, (12), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-22 16:11:22,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-07-22 16:11:22,595 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-07-22 16:11:22,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:11:22,595 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-07-22 16:11:22,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:11:22,596 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-07-22 16:11:22,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-22 16:11:22,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:11:22,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:11:22,624 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-22 16:11:22,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:11:22,817 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:11:22,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:11:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1187327748, now seen corresponding path program 1 times [2022-07-22 16:11:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:11:22,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [287529789] [2022-07-22 16:11:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:11:22,819 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:11:22,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:11:22,821 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:11:22,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-22 16:11:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:11:23,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-22 16:11:23,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:11:55,927 WARN L833 $PredicateComparison]: unable to prove that (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-07-22 16:12:12,520 WARN L833 $PredicateComparison]: unable to prove that (or (= (_ bv1 32) c___VERIFIER_assert_~cond) (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) (= (_ bv0 32) c___VERIFIER_assert_~cond))) is different from false [2022-07-22 16:12:27,629 WARN L833 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from false [2022-07-22 16:12:29,671 WARN L855 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) is different from true [2022-07-22 16:12:29,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-22 16:12:29,672 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 16:12:29,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:12:29,672 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [287529789] [2022-07-22 16:12:29,672 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [287529789] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 16:12:29,672 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 16:12:29,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-22 16:12:29,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134045506] [2022-07-22 16:12:29,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 16:12:29,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-22 16:12:29,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:12:29,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-22 16:12:29,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=19, Unknown=4, NotChecked=30, Total=72 [2022-07-22 16:12:29,675 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:12:32,846 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.05s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:35,135 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:37,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:39,287 WARN L833 $PredicateComparison]: unable to prove that (and (or (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| (_ FloatingPoint 11 53))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (_ bv0 32)))) (and (not (= ((_ fp.to_sbv 32) roundTowardZero (fp.add roundNearestTiesToEven (fp.sub roundNearestTiesToEven (fp.sub roundNearestTiesToEven .cse0 |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1|) .cse0) (fp.mul roundNearestTiesToEven ((_ to_fp 11 53) roundNearestTiesToEven (_ bv2 32)) (fp.div roundNearestTiesToEven |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven 2.0))))) (_ bv0 32))) (fp.leq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| ((_ to_fp 11 53) roundNearestTiesToEven (_ bv5 32))) (fp.geq |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_1| .cse0)))) (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 16:12:41,546 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:43,707 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.16s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:45,059 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:47,350 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:49,355 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:51,571 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:53,579 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:12:53,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:12:53,580 INFO L93 Difference]: Finished difference Result 22 states and 25 transitions. [2022-07-22 16:12:53,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-22 16:12:53,647 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-07-22 16:12:53,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:12:53,648 INFO L225 Difference]: With dead ends: 22 [2022-07-22 16:12:53,648 INFO L226 Difference]: Without dead ends: 20 [2022-07-22 16:12:53,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=26, Invalid=27, Unknown=5, NotChecked=52, Total=110 [2022-07-22 16:12:53,650 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 9 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 7 mSolverCounterUnsat, 9 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 9 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 21.3s IncrementalHoareTripleChecker+Time [2022-07-22 16:12:53,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 24 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 9 Invalid, 9 Unknown, 33 Unchecked, 21.3s Time] [2022-07-22 16:12:53,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-22 16:12:53,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-07-22 16:12:53,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 14 states have internal predecessors, (15), 3 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:12:53,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-07-22 16:12:53,655 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 9 [2022-07-22 16:12:53,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:12:53,656 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-07-22 16:12:53,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.0) internal successors, (8), 7 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 16:12:53,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-07-22 16:12:53,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-22 16:12:53,657 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:12:53,657 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:12:53,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-22 16:12:53,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:12:53,860 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:12:53,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:12:53,861 INFO L85 PathProgramCache]: Analyzing trace with hash -713464030, now seen corresponding path program 1 times [2022-07-22 16:12:53,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:12:53,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [4876506] [2022-07-22 16:12:53,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:12:53,862 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:12:53,862 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:12:53,863 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:12:53,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-22 16:12:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:12:54,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-22 16:12:54,181 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:13:00,508 WARN L833 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from false [2022-07-22 16:13:02,582 WARN L855 $PredicateComparison]: unable to prove that (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |c_ULTIMATE.start_main_~r~0#1| |c_ULTIMATE.start_main_~r~0#1|)) |c_ULTIMATE.start_main_~a~0#1|) ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~r~0#1|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |c_ULTIMATE.start_main_~x~0#1|))) (_ bv0 32)) is different from true [2022-07-22 16:13:15,091 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32))) is different from false [2022-07-22 16:13:23,439 WARN L833 $PredicateComparison]: unable to prove that (and (= (_ bv1 32) c___VERIFIER_assert_~cond) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32)))) is different from false [2022-07-22 16:13:23,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 16:13:23,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-22 16:13:48,465 WARN L233 SmtUtils]: Spent 16.59s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 16:14:05,067 WARN L233 SmtUtils]: Spent 16.60s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 316] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2022-07-22 16:14:11,336 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-22 16:14:21,782 WARN L855 $PredicateComparison]: unable to prove that (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from true [2022-07-22 16:14:21,785 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-22 16:14:21,786 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 16:14:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [4876506] [2022-07-22 16:14:21,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [4876506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-22 16:14:21,786 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-22 16:14:21,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-07-22 16:14:21,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764031301] [2022-07-22 16:14:21,787 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-22 16:14:21,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-22 16:14:21,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 16:14:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-22 16:14:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=17, Unknown=6, NotChecked=50, Total=90 [2022-07-22 16:14:21,788 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 16:14:23,941 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.15s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:14:25,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-07-22 16:14:28,145 WARN L855 $PredicateComparison]: unable to prove that (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) (= (_ bv0 32) c___VERIFIER_assert_~cond) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) is different from true [2022-07-22 16:14:30,255 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32))))) (and (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0) .cse0)) is different from true [2022-07-22 16:14:32,333 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (= |c___VERIFIER_assert_#in~cond| (_ bv1 32)) (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))) is different from false [2022-07-22 16:14:34,416 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from false [2022-07-22 16:14:36,485 WARN L855 $PredicateComparison]: unable to prove that (let ((.cse0 (= (_ bv0 32) c___VERIFIER_assert_~cond))) (and (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond) (= (_ bv1 32) c___VERIFIER_assert_~cond) (not .cse0) (exists ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2| (_ FloatingPoint 11 53)) (currentRoundingMode RoundingMode)) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add currentRoundingMode (fp.sub currentRoundingMode (fp.sub currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_2|) ((_ to_fp 11 53) currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_2|)) (fp.mul currentRoundingMode ((_ to_fp 11 53) currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_2|))) (_ bv0 32))) (or (forall ((|v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53)) (|v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3| (_ FloatingPoint 11 53))) (= ((_ fp.to_sbv 32) roundTowardZero (fp.add c_currentRoundingMode (fp.sub c_currentRoundingMode (fp.sub c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (bvmul |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3| |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) |v_ULTIMATE.start_main_~a~0#1_BEFORE_CALL_3|) ((_ to_fp 11 53) c_currentRoundingMode |v_ULTIMATE.start_main_~r~0#1_BEFORE_CALL_3|)) (fp.mul c_currentRoundingMode ((_ to_fp 11 53) c_currentRoundingMode (_ bv2 32)) |v_ULTIMATE.start_main_~x~0#1_BEFORE_CALL_3|))) (_ bv0 32))) .cse0 (not (= |c___VERIFIER_assert_#in~cond| (_ bv0 32)))))) is different from true [2022-07-22 16:14:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 16:14:36,488 INFO L93 Difference]: Finished difference Result 22 states and 24 transitions. [2022-07-22 16:14:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-22 16:14:36,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 15 [2022-07-22 16:14:36,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 16:14:36,489 INFO L225 Difference]: With dead ends: 22 [2022-07-22 16:14:36,489 INFO L226 Difference]: Without dead ends: 17 [2022-07-22 16:14:36,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.0s TimeCoverageRelationStatistics Valid=25, Invalid=20, Unknown=11, NotChecked=126, Total=182 [2022-07-22 16:14:36,491 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-22 16:14:36,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 41 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 2 Unknown, 41 Unchecked, 4.3s Time] [2022-07-22 16:14:36,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-07-22 16:14:36,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-07-22 16:14:36,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.0769230769230769) internal successors, (14), 13 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-22 16:14:36,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-07-22 16:14:36,495 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 15 [2022-07-22 16:14:36,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 16:14:36,497 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-07-22 16:14:36,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 9 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-07-22 16:14:36,497 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-07-22 16:14:36,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-22 16:14:36,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 16:14:36,498 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 16:14:36,517 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-07-22 16:14:36,698 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-22 16:14:36,698 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 16:14:36,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 16:14:36,699 INFO L85 PathProgramCache]: Analyzing trace with hash -610823942, now seen corresponding path program 1 times [2022-07-22 16:14:36,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 16:14:36,699 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320666397] [2022-07-22 16:14:36,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 16:14:36,700 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 16:14:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 16:14:36,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-22 16:14:36,703 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-22 16:14:40,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 16:14:40,317 INFO L263 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-22 16:14:40,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 16:14:57,091 WARN L233 SmtUtils]: Spent 5.88s on a formula simplification that was a NOOP. DAG size: 18 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 16:15:34,273 WARN L233 SmtUtils]: Spent 5.51s on a formula simplification that was a NOOP. DAG size: 20 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)