./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.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/float-benchs/interpolation.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:50:18,243 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:50:18,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:50:18,288 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:50:18,289 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:50:18,291 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:50:18,293 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:50:18,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:50:18,295 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:50:18,298 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:50:18,299 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:50:18,301 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:50:18,301 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:50:18,303 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:50:18,304 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:50:18,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:50:18,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:50:18,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:50:18,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:50:18,313 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:50:18,314 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:50:18,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:50:18,316 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:50:18,316 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:50:18,317 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:50:18,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:50:18,322 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:50:18,322 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:50:18,323 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:50:18,324 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:50:18,324 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:50:18,325 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:50:18,326 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:50:18,326 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:50:18,327 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:50:18,328 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:50:18,328 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:50:18,328 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:50:18,329 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:50:18,329 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:50:18,329 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:50:18,330 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:50:18,331 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-22 13:50:18,357 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:50:18,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:50:18,357 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:50:18,358 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:50:18,358 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:50:18,358 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:50:18,359 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:50:18,359 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:50:18,359 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:50:18,360 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:50:18,360 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:50:18,360 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-22 13:50:18,360 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:50:18,360 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:50:18,361 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:50:18,361 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:50:18,361 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:50:18,361 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:50:18,361 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:50:18,362 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:50:18,362 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:50:18,362 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:50:18,362 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:50:18,362 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:50:18,362 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:50:18,363 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:50:18,363 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:50:18,363 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:50:18,363 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-22 13:50:18,363 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-22 13:50:18,364 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:50:18,364 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:50:18,364 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:50:18,364 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2022-07-22 13:50:18,536 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:50:18,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:50:18,550 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:50:18,551 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:50:18,551 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:50:18,552 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-07-22 13:50:18,592 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24667bf95/e0b82eaf846b4d7a8995e291e54e9edc/FLAG03d011072 [2022-07-22 13:50:18,950 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:50:18,951 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-07-22 13:50:18,956 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24667bf95/e0b82eaf846b4d7a8995e291e54e9edc/FLAG03d011072 [2022-07-22 13:50:19,359 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24667bf95/e0b82eaf846b4d7a8995e291e54e9edc [2022-07-22 13:50:19,360 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:50:19,361 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:50:19,364 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:50:19,364 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:50:19,366 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:50:19,366 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,367 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a0fc4cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19, skipping insertion in model container [2022-07-22 13:50:19,367 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,372 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:50:19,380 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:50:19,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-07-22 13:50:19,514 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:50:19,519 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:50:19,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-07-22 13:50:19,534 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:50:19,542 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:50:19,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19 WrapperNode [2022-07-22 13:50:19,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:50:19,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:50:19,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:50:19,543 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:50:19,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,552 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,564 INFO L137 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 108 [2022-07-22 13:50:19,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:50:19,564 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:50:19,564 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:50:19,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:50:19,569 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,569 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,571 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,571 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,575 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,582 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,583 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:50:19,584 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:50:19,585 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:50:19,585 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:50:19,585 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (1/1) ... [2022-07-22 13:50:19,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:50:19,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:50:19,618 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 13:50:19,622 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 13:50:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:50:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-22 13:50:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 13:50:19,656 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2022-07-22 13:50:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:50:19,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:50:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real [2022-07-22 13:50:19,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 13:50:19,700 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:50:19,701 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:50:19,820 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:50:19,824 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:50:19,824 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 13:50:19,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:50:19 BoogieIcfgContainer [2022-07-22 13:50:19,826 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:50:19,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:50:19,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:50:19,830 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:50:19,830 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:50:19" (1/3) ... [2022-07-22 13:50:19,830 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576018c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:50:19, skipping insertion in model container [2022-07-22 13:50:19,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:19" (2/3) ... [2022-07-22 13:50:19,831 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@576018c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:50:19, skipping insertion in model container [2022-07-22 13:50:19,831 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:50:19" (3/3) ... [2022-07-22 13:50:19,832 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2022-07-22 13:50:19,842 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:50:19,842 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:50:19,873 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:50:19,878 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@5800bf5e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@ac52c28 [2022-07-22 13:50:19,878 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:50:19,881 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:19,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 13:50:19,887 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:50:19,888 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:50:19,888 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:50:19,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:50:19,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2022-07-22 13:50:19,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:50:19,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322781500] [2022-07-22 13:50:19,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:50:19,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:50:19,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:50:20,057 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 13:50:20,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:50:20,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322781500] [2022-07-22 13:50:20,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [322781500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:50:20,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:50:20,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-22 13:50:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989010492] [2022-07-22 13:50:20,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:50:20,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-22 13:50:20,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:50:20,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-22 13:50:20,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-22 13:50:20,094 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:20,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:50:20,166 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-22 13:50:20,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-22 13:50:20,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 13:50:20,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:50:20,175 INFO L225 Difference]: With dead ends: 31 [2022-07-22 13:50:20,175 INFO L226 Difference]: Without dead ends: 15 [2022-07-22 13:50:20,180 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-22 13:50:20,187 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:50:20,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 65 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:50:20,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-07-22 13:50:20,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-07-22 13:50:20,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:20,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-07-22 13:50:20,218 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 12 [2022-07-22 13:50:20,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:50:20,218 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-07-22 13:50:20,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:20,219 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-07-22 13:50:20,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 13:50:20,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:50:20,220 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:50:20,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-22 13:50:20,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:50:20,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:50:20,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1736001843, now seen corresponding path program 1 times [2022-07-22 13:50:20,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:50:20,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890899322] [2022-07-22 13:50:20,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:50:20,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:50:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:50:20,268 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 13:50:20,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-22 13:50:20,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890899322] [2022-07-22 13:50:20,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890899322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:50:20,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:50:20,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:50:20,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580688714] [2022-07-22 13:50:20,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:50:20,272 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:50:20,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-22 13:50:20,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:50:20,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:50:20,273 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:20,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:50:20,291 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2022-07-22 13:50:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:50:20,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 13:50:20,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:50:20,293 INFO L225 Difference]: With dead ends: 33 [2022-07-22 13:50:20,293 INFO L226 Difference]: Without dead ends: 25 [2022-07-22 13:50:20,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:50:20,295 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-22 13:50:20,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 27 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-22 13:50:20,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-22 13:50:20,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 16. [2022-07-22 13:50:20,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-07-22 13:50:20,301 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 12 [2022-07-22 13:50:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:50:20,302 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-07-22 13:50:20,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:20,304 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-07-22 13:50:20,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:50:20,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:50:20,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:50:20,305 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-22 13:50:20,306 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:50:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:50:20,307 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2022-07-22 13:50:20,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-22 13:50:20,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268735019] [2022-07-22 13:50:20,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:50:20,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-22 13:50:20,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:50:20,324 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-22 13:50:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-22 13:50:20,347 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-22 13:50:20,347 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-22 13:50:20,348 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-22 13:50:20,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-22 13:50:20,352 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-07-22 13:50:20,354 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-22 13:50:20,377 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.07 01:50:20 BoogieIcfgContainer [2022-07-22 13:50:20,377 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-22 13:50:20,378 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-22 13:50:20,378 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-22 13:50:20,378 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-22 13:50:20,378 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:50:19" (3/4) ... [2022-07-22 13:50:20,381 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-22 13:50:20,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-22 13:50:20,381 INFO L158 Benchmark]: Toolchain (without parser) took 1019.74ms. Allocated memory is still 115.3MB. Free memory was 87.5MB in the beginning and 74.8MB in the end (delta: 12.6MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-07-22 13:50:20,382 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:50:20,385 INFO L158 Benchmark]: CACSL2BoogieTranslator took 178.79ms. Allocated memory is still 115.3MB. Free memory was 87.2MB in the beginning and 90.0MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-22 13:50:20,385 INFO L158 Benchmark]: Boogie Procedure Inliner took 20.86ms. Allocated memory is still 115.3MB. Free memory was 90.0MB in the beginning and 88.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-22 13:50:20,385 INFO L158 Benchmark]: Boogie Preprocessor took 19.14ms. Allocated memory is still 115.3MB. Free memory was 88.2MB in the beginning and 86.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 13:50:20,386 INFO L158 Benchmark]: RCFGBuilder took 241.80ms. Allocated memory is still 115.3MB. Free memory was 86.9MB in the beginning and 76.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-22 13:50:20,386 INFO L158 Benchmark]: TraceAbstraction took 550.35ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 75.4MB in the end (delta: 419.1kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. [2022-07-22 13:50:20,386 INFO L158 Benchmark]: Witness Printer took 3.00ms. Allocated memory is still 115.3MB. Free memory was 75.4MB in the beginning and 74.8MB in the end (delta: 598.2kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-22 13:50:20,388 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.14ms. Allocated memory is still 83.9MB. Free memory is still 42.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 178.79ms. Allocated memory is still 115.3MB. Free memory was 87.2MB in the beginning and 90.0MB in the end (delta: -2.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 20.86ms. Allocated memory is still 115.3MB. Free memory was 90.0MB in the beginning and 88.2MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.14ms. Allocated memory is still 115.3MB. Free memory was 88.2MB in the beginning and 86.9MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 241.80ms. Allocated memory is still 115.3MB. Free memory was 86.9MB in the beginning and 76.2MB in the end (delta: 10.7MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 550.35ms. Allocated memory is still 115.3MB. Free memory was 75.8MB in the beginning and 75.4MB in the end (delta: 419.1kB). Peak memory consumption was 2.4MB. Max. memory is 16.1GB. * Witness Printer took 3.00ms. Allocated memory is still 115.3MB. Free memory was 75.4MB in the beginning and 74.8MB in the end (delta: 598.2kB). Peak memory consumption was 2.1MB. 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: 51]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 33, overapproximation of someBinaryDOUBLEComparisonOperation at line 38, overapproximation of to_real at line 18, overapproximation of someBinaryArithmeticFLOAToperation at line 36. Possible FailurePath: [L1] int __return_main; [L12] int __return_125; VAL [__return_125=0, __return_main=0] [L15] int main__i; [L16] float main__z; [L17] float main__t; [L18] float main__min[5] = { 5, 10, 12, 30, 150 }; [L19] float main__max[5] = { 10, 12, 30, 150, 300 }; [L20] main__t = __VERIFIER_nondet_float() [L21] int main____CPAchecker_TMP_0; [L22] EXPR main__min[0] VAL [__return_125=0, __return_main=0, main__max={5:0}, main__min={4:0}, main__min[0]=49] [L22] COND TRUE main__t >= (main__min[0]) [L24] EXPR main__max[4UL] VAL [__return_125=0, __return_main=0, main__max={5:0}, main__max[4UL]=51, main__min={4:0}] [L24] COND TRUE main__t <= (main__max[4UL]) [L26] main____CPAchecker_TMP_0 = 1 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__max={5:0}, main__min={4:0}] [L27] COND TRUE main____CPAchecker_TMP_0 != 0 [L29] main__i = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L31] COND TRUE main__i < 5UL [L33] EXPR main__max[main__i] VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__max[main__i]=50, main__min={4:0}] [L33] COND TRUE main__t <= (main__max[main__i]) [L36] EXPR main__min[main__i] [L36] EXPR main__max[main__i] [L36] EXPR main__min[main__i] [L36] main__z = (main__t - (main__min[main__i])) / ((main__max[main__i]) - (main__min[main__i])) [L37] int main____CPAchecker_TMP_1; VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L38] COND FALSE !(main__z >= 0.0) VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main__i=0, main__max={5:0}, main__min={4:0}] [L64] main____CPAchecker_TMP_1 = 0 VAL [__return_125=0, __return_main=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L45] int __tmp_1; [L46] __tmp_1 = main____CPAchecker_TMP_1 [L47] int __VERIFIER_assert__cond; [L48] __VERIFIER_assert__cond = __tmp_1 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L49] COND TRUE __VERIFIER_assert__cond == 0 VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] [L51] reach_error() VAL [__return_125=0, __return_main=0, __tmp_1=0, __VERIFIER_assert__cond=0, main____CPAchecker_TMP_0=1, main____CPAchecker_TMP_1=0, main__i=0, main__max={5:0}, main__min={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 18 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 0.5s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 40 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 40 mSDsluCounter, 92 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 55 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 19 IncrementalHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 37 mSDtfsCounter, 19 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=0, InterpolantAutomatonStates: 9, 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, 2 MinimizatonAttempts, 9 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 37 NumberOfCodeBlocks, 37 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 32 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 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 13:50:20,418 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-22 13:50:22,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-22 13:50:22,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-22 13:50:22,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-22 13:50:22,160 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-22 13:50:22,161 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-22 13:50:22,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-22 13:50:22,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-22 13:50:22,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-22 13:50:22,171 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-22 13:50:22,172 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-22 13:50:22,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-22 13:50:22,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-22 13:50:22,175 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-22 13:50:22,176 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-22 13:50:22,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-22 13:50:22,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-22 13:50:22,182 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-22 13:50:22,183 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-22 13:50:22,188 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-22 13:50:22,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-22 13:50:22,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-22 13:50:22,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-22 13:50:22,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-22 13:50:22,193 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-22 13:50:22,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-22 13:50:22,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-22 13:50:22,198 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-22 13:50:22,199 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-22 13:50:22,199 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-22 13:50:22,200 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-22 13:50:22,200 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-22 13:50:22,201 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-22 13:50:22,202 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-22 13:50:22,203 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-22 13:50:22,203 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-22 13:50:22,203 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-22 13:50:22,204 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-22 13:50:22,204 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-22 13:50:22,204 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-22 13:50:22,205 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-22 13:50:22,206 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-22 13:50:22,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-07-22 13:50:22,245 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-22 13:50:22,246 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-22 13:50:22,246 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-22 13:50:22,246 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-22 13:50:22,247 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-22 13:50:22,247 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-22 13:50:22,248 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-22 13:50:22,248 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-22 13:50:22,248 INFO L138 SettingsManager]: * Use SBE=true [2022-07-22 13:50:22,249 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-22 13:50:22,249 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-22 13:50:22,249 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-22 13:50:22,249 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-22 13:50:22,249 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-22 13:50:22,249 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-22 13:50:22,250 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-22 13:50:22,250 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-22 13:50:22,250 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-22 13:50:22,250 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-22 13:50:22,250 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-22 13:50:22,250 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-22 13:50:22,251 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-22 13:50:22,251 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-22 13:50:22,251 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-22 13:50:22,251 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-22 13:50:22,251 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-22 13:50:22,251 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:50:22,251 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-22 13:50:22,252 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-22 13:50:22,252 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-22 13:50:22,252 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-22 13:50:22,252 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-22 13:50:22,252 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-22 13:50:22,252 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-22 13:50:22,253 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-22 13:50:22,253 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-22 13:50:22,253 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 -> a8b1eb5a7109aada0c5a8e0cf18025c738de8d1a2cd1a38b7a389d7c7a6495a7 [2022-07-22 13:50:22,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-22 13:50:22,535 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-22 13:50:22,538 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-22 13:50:22,538 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-22 13:50:22,539 INFO L275 PluginConnector]: CDTParser initialized [2022-07-22 13:50:22,540 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-07-22 13:50:22,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63fc8cf6/e4fc8e863beb4e188b4b1580422dbfff/FLAG7df3ad8cd [2022-07-22 13:50:22,967 INFO L306 CDTParser]: Found 1 translation units. [2022-07-22 13:50:22,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c [2022-07-22 13:50:22,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63fc8cf6/e4fc8e863beb4e188b4b1580422dbfff/FLAG7df3ad8cd [2022-07-22 13:50:22,985 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d63fc8cf6/e4fc8e863beb4e188b4b1580422dbfff [2022-07-22 13:50:22,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-22 13:50:22,988 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-22 13:50:22,990 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-22 13:50:22,990 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-22 13:50:22,992 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-22 13:50:22,993 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:50:22" (1/1) ... [2022-07-22 13:50:22,994 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10a1793e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:22, skipping insertion in model container [2022-07-22 13:50:22,994 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.07 01:50:22" (1/1) ... [2022-07-22 13:50:22,999 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-22 13:50:23,011 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-22 13:50:23,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-07-22 13:50:23,187 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:50:23,197 INFO L203 MainTranslator]: Completed pre-run [2022-07-22 13:50:23,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/float-benchs/interpolation.c.v+cfa-reducer.c[1314,1327] [2022-07-22 13:50:23,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-22 13:50:23,229 INFO L208 MainTranslator]: Completed translation [2022-07-22 13:50:23,230 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23 WrapperNode [2022-07-22 13:50:23,230 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-22 13:50:23,231 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-22 13:50:23,231 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-22 13:50:23,231 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-22 13:50:23,236 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,243 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,257 INFO L137 Inliner]: procedures = 19, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 109 [2022-07-22 13:50:23,257 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-22 13:50:23,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-22 13:50:23,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-22 13:50:23,258 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-22 13:50:23,263 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,273 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,273 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,286 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,292 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-22 13:50:23,301 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-22 13:50:23,301 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-22 13:50:23,302 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-22 13:50:23,303 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (1/1) ... [2022-07-22 13:50:23,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-22 13:50:23,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-22 13:50:23,327 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 13:50:23,350 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 13:50:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-22 13:50:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4 [2022-07-22 13:50:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-22 13:50:23,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-22 13:50:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4 [2022-07-22 13:50:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-22 13:50:23,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-22 13:50:23,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-22 13:50:23,427 INFO L234 CfgBuilder]: Building ICFG [2022-07-22 13:50:23,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-22 13:50:23,934 INFO L275 CfgBuilder]: Performing block encoding [2022-07-22 13:50:23,938 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-22 13:50:23,938 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-22 13:50:23,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:50:23 BoogieIcfgContainer [2022-07-22 13:50:23,939 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-22 13:50:23,940 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-22 13:50:23,941 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-22 13:50:23,942 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-22 13:50:23,942 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.07 01:50:22" (1/3) ... [2022-07-22 13:50:23,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cdf7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:50:23, skipping insertion in model container [2022-07-22 13:50:23,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.07 01:50:23" (2/3) ... [2022-07-22 13:50:23,943 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40cdf7aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.07 01:50:23, skipping insertion in model container [2022-07-22 13:50:23,943 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.07 01:50:23" (3/3) ... [2022-07-22 13:50:23,944 INFO L111 eAbstractionObserver]: Analyzing ICFG interpolation.c.v+cfa-reducer.c [2022-07-22 13:50:23,952 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-22 13:50:23,953 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-22 13:50:23,978 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-22 13:50:23,981 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@6a0ad3b9, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e986185 [2022-07-22 13:50:23,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-22 13:50:23,984 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:23,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-22 13:50:23,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:50:23,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:50:23,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:50:23,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:50:24,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1718991182, now seen corresponding path program 1 times [2022-07-22 13:50:24,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:50:24,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [896018508] [2022-07-22 13:50:24,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:50:24,024 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:50:24,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:50:24,026 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 13:50:24,027 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 13:50:24,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:50:24,289 INFO L263 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-22 13:50:24,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:50:24,338 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 13:50:24,339 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:50:24,339 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:50:24,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [896018508] [2022-07-22 13:50:24,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [896018508] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:50:24,341 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:50:24,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-22 13:50:24,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756724421] [2022-07-22 13:50:24,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:50:24,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-22 13:50:24,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:50:24,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-22 13:50:24,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:50:24,374 INFO L87 Difference]: Start difference. First operand has 18 states, 16 states have (on average 1.5625) internal successors, (25), 17 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:26,503 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 13:50:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:50:26,549 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-07-22 13:50:26,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-22 13:50:26,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-22 13:50:26,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:50:26,556 INFO L225 Difference]: With dead ends: 32 [2022-07-22 13:50:26,556 INFO L226 Difference]: Without dead ends: 18 [2022-07-22 13:50:26,558 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-22 13:50:26,561 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 13:50:26,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 39 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 13:50:26,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-07-22 13:50:26,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2022-07-22 13:50:26,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:26,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2022-07-22 13:50:26,595 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 19 transitions. Word has length 12 [2022-07-22 13:50:26,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:50:26,596 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 19 transitions. [2022-07-22 13:50:26,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:26,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 19 transitions. [2022-07-22 13:50:26,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:50:26,597 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:50:26,597 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:50:26,613 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-07-22 13:50:26,809 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 13:50:26,810 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:50:26,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:50:26,813 INFO L85 PathProgramCache]: Analyzing trace with hash -859311250, now seen corresponding path program 1 times [2022-07-22 13:50:26,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:50:26,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1320311045] [2022-07-22 13:50:26,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:50:26,816 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:50:26,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:50:26,817 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 13:50:26,823 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 13:50:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:50:27,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-22 13:50:27,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:50:27,078 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 13:50:27,078 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:50:27,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:50:27,078 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1320311045] [2022-07-22 13:50:27,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1320311045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:50:27,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:50:27,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-22 13:50:27,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412012504] [2022-07-22 13:50:27,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:50:27,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-22 13:50:27,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:50:27,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-22 13:50:27,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-22 13:50:27,080 INFO L87 Difference]: Start difference. First operand 16 states and 19 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:29,187 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 13:50:29,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:50:29,255 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions. [2022-07-22 13:50:29,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-22 13:50:29,256 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:50:29,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:50:29,257 INFO L225 Difference]: With dead ends: 20 [2022-07-22 13:50:29,257 INFO L226 Difference]: Without dead ends: 16 [2022-07-22 13:50:29,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-22 13:50:29,258 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 1 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-22 13:50:29,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 45 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-07-22 13:50:29,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-07-22 13:50:29,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2022-07-22 13:50:29,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:29,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-07-22 13:50:29,261 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 13 [2022-07-22 13:50:29,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:50:29,261 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-07-22 13:50:29,261 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:50:29,261 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-07-22 13:50:29,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-22 13:50:29,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:50:29,261 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:50:29,278 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 13:50:29,475 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 13:50:29,476 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:50:29,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:50:29,476 INFO L85 PathProgramCache]: Analyzing trace with hash -842300589, now seen corresponding path program 1 times [2022-07-22 13:50:29,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:50:29,477 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [909089024] [2022-07-22 13:50:29,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:50:29,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:50:29,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:50:29,480 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 13:50:29,484 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 13:50:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:50:29,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 18 conjunts are in the unsatisfiable core [2022-07-22 13:50:29,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:50:31,520 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 13:50:31,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2022-07-22 13:51:06,012 WARN L233 SmtUtils]: Spent 15.07s on a formula simplification. DAG size of input: 39 DAG size of output: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-22 13:51:29,692 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2022-07-22 13:51:31,718 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2022-07-22 13:51:52,752 WARN L833 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from false [2022-07-22 13:51:54,778 WARN L855 $PredicateComparison]: unable to prove that (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3)))) (and (not (fp.geq ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.sub roundNearestTiesToEven .cse1 .cse0))) (_ +zero 11 53))) (= .cse0 ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32))) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse0) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1)))) is different from true [2022-07-22 13:52:26,736 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 13:52:26,736 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:52:26,737 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:52:26,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [909089024] [2022-07-22 13:52:26,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [909089024] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:52:26,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:52:26,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-22 13:52:26,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288856754] [2022-07-22 13:52:26,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:52:26,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-22 13:52:26,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:52:26,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-22 13:52:26,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=60, Unknown=5, NotChecked=34, Total=132 [2022-07-22 13:52:26,738 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:52:29,663 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__max~0#1.base|)) (.cse3 (let ((.cse7 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~#main__min~0#1.base|) |c_ULTIMATE.start_main_~#main__min~0#1.offset|))) (fp ((_ extract 31 31) .cse7) ((_ extract 30 23) .cse7) ((_ extract 22 0) .cse7))))) (and (= |c_ULTIMATE.start_main_~#main__min~0#1.offset| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)) (let ((.cse0 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv16 32))))) (fp ((_ extract 31 31) .cse0) ((_ extract 30 23) .cse0) ((_ extract 22 0) .cse0)))) (= |c_ULTIMATE.start_main_~#main__max~0#1.offset| (_ bv0 32)) (fp.leq |c_ULTIMATE.start_main_~main__t~0#1| (let ((.cse2 (select .cse1 (bvadd |c_ULTIMATE.start_main_~#main__max~0#1.offset| (bvmul (_ bv4 32) |c_ULTIMATE.start_main_~main__i~0#1|))))) (fp ((_ extract 31 31) .cse2) ((_ extract 30 23) .cse2) ((_ extract 22 0) .cse2)))) (fp.geq |c_ULTIMATE.start_main_~main__t~0#1| .cse3) (exists ((v_arrayElimCell_1 (_ BitVec 32)) (|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_3 (_ BitVec 32))) (let ((.cse4 (fp ((_ extract 31 31) v_arrayElimCell_3) ((_ extract 30 23) v_arrayElimCell_3) ((_ extract 22 0) v_arrayElimCell_3))) (.cse5 (fp ((_ extract 31 31) v_arrayElimCell_1) ((_ extract 30 23) v_arrayElimCell_1) ((_ extract 22 0) v_arrayElimCell_1)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse4) (= .cse5 ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32))) (= (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse5) (fp.sub c_currentRoundingMode .cse4 .cse5)) |c_ULTIMATE.start_main_~main__z~0#1|) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse4) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse5)))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) (let ((.cse6 (select .cse1 |c_ULTIMATE.start_main_~#main__max~0#1.offset|))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (= |c_ULTIMATE.start_main_~main__i~0#1| (_ bv0 32)) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse3) (= c_currentRoundingMode roundNearestTiesToEven))) is different from false [2022-07-22 13:52:31,785 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 13:52:33,793 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-22 13:52:34,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-22 13:52:34,096 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-22 13:52:34,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-22 13:52:34,101 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-22 13:52:34,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-22 13:52:34,101 INFO L225 Difference]: With dead ends: 26 [2022-07-22 13:52:34,101 INFO L226 Difference]: Without dead ends: 21 [2022-07-22 13:52:34,103 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 39.4s TimeCoverageRelationStatistics Valid=35, Invalid=61, Unknown=6, NotChecked=54, Total=156 [2022-07-22 13:52:34,104 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 14 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-22 13:52:34,104 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 14 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 2 Unknown, 51 Unchecked, 5.2s Time] [2022-07-22 13:52:34,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-22 13:52:34,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-07-22 13:52:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:52:34,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-07-22 13:52:34,108 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-07-22 13:52:34,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-22 13:52:34,108 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-07-22 13:52:34,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:52:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-07-22 13:52:34,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-22 13:52:34,108 INFO L187 NwaCegarLoop]: Found error trace [2022-07-22 13:52:34,108 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-22 13:52:34,121 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 13:52:34,309 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 13:52:34,309 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-22 13:52:34,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-22 13:52:34,310 INFO L85 PathProgramCache]: Analyzing trace with hash -858361424, now seen corresponding path program 1 times [2022-07-22 13:52:34,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-22 13:52:34,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1742724470] [2022-07-22 13:52:34,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-22 13:52:34,310 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-22 13:52:34,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-22 13:52:34,316 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 13:52:34,318 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 13:52:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-22 13:52:34,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-22 13:52:34,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-22 13:52:37,030 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-22 13:52:37,030 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 178 treesize of output 86 [2022-07-22 13:52:44,455 WARN L833 $PredicateComparison]: unable to prove that (and (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:53:00,163 WARN L833 $PredicateComparison]: unable to prove that (and (fp.geq ((_ to_fp 11 53) c_currentRoundingMode |c_ULTIMATE.start_main_~main__z~0#1|) (_ +zero 11 53)) (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse0 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse1 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (and (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv10 32)) .cse0) (= |c_ULTIMATE.start_main_~main__z~0#1| (fp.div c_currentRoundingMode (fp.sub c_currentRoundingMode |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.sub c_currentRoundingMode .cse0 .cse1))) (= ((_ to_fp 8 24) c_currentRoundingMode (_ bv5 32)) .cse1) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse0) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse1)))) (exists ((v_arrayElimCell_5 (_ BitVec 32))) (= (fp ((_ extract 31 31) v_arrayElimCell_5) ((_ extract 30 23) v_arrayElimCell_5) ((_ extract 22 0) v_arrayElimCell_5)) ((_ to_fp 8 24) c_currentRoundingMode (_ bv300 32)))) (= c_currentRoundingMode roundNearestTiesToEven)) is different from false [2022-07-22 13:53:28,509 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from false [2022-07-22 13:53:30,540 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1) (fp.geq |ULTIMATE.start_main_~main__t~0#1| .cse2))))) is different from true [2022-07-22 13:53:55,229 WARN L833 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from false [2022-07-22 13:53:57,257 WARN L855 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start_main_~main__t~0#1| (_ FloatingPoint 8 24)) (v_arrayElimCell_6 (_ BitVec 32)) (v_arrayElimCell_4 (_ BitVec 32))) (let ((.cse1 (fp ((_ extract 31 31) v_arrayElimCell_6) ((_ extract 30 23) v_arrayElimCell_6) ((_ extract 22 0) v_arrayElimCell_6))) (.cse2 (fp ((_ extract 31 31) v_arrayElimCell_4) ((_ extract 30 23) v_arrayElimCell_4) ((_ extract 22 0) v_arrayElimCell_4)))) (let ((.cse0 ((_ to_fp 11 53) roundNearestTiesToEven (fp.div roundNearestTiesToEven (fp.sub roundNearestTiesToEven |ULTIMATE.start_main_~main__t~0#1| .cse2) (fp.sub roundNearestTiesToEven .cse1 .cse2))))) (and (fp.geq .cse0 (_ +zero 11 53)) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv10 32)) .cse1) (not (fp.leq .cse0 ((_ to_fp 11 53) roundNearestTiesToEven 1.0))) (= ((_ to_fp 8 24) roundNearestTiesToEven (_ bv5 32)) .cse2) (fp.leq |ULTIMATE.start_main_~main__t~0#1| .cse1))))) is different from true [2022-07-22 13:54:42,574 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 13:54:42,574 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-22 13:54:42,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-22 13:54:42,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1742724470] [2022-07-22 13:54:42,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1742724470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-22 13:54:42,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-22 13:54:42,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-22 13:54:42,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281118244] [2022-07-22 13:54:42,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-22 13:54:42,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-22 13:54:42,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-22 13:54:42,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-22 13:54:42,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=48, Unknown=6, NotChecked=68, Total=156 [2022-07-22 13:54:42,576 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 13 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-22 13:54:44,672 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []