./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-examples/sanfoundry_24-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-examples/sanfoundry_24-1.i -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 e0a16588b251f5de7b3febde43795c7086835cc989637b8bd82aa8d6af355c6b --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:01:14,515 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:01:14,517 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:01:14,552 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:01:14,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:01:14,556 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:01:14,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:01:14,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:01:14,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:01:14,563 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:01:14,564 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:01:14,565 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:01:14,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:01:14,568 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:01:14,569 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:01:14,571 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:01:14,572 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:01:14,572 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:01:14,574 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:01:14,578 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:01:14,579 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:01:14,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:01:14,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:01:14,582 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:01:14,586 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:01:14,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:01:14,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:01:14,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:01:14,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:01:14,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:01:14,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:01:14,590 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:01:14,591 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:01:14,592 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:01:14,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:01:14,593 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:01:14,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:01:14,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:01:14,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:01:14,595 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:01:14,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:01:14,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:01:14,620 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:01:14,621 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:01:14,621 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:01:14,621 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:01:14,622 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:01:14,622 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:01:14,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:01:14,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:01:14,623 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:01:14,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:01:14,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:01:14,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:01:14,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:01:14,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:01:14,624 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:01:14,624 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:01:14,625 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:01:14,625 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:01:14,625 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:01:14,625 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:01:14,625 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:01:14,625 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:01:14,625 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:01:14,626 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:01:14,626 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:14,626 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:01:14,626 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:01:14,627 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:01:14,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:01:14,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:01:14,628 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:01:14,628 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:01:14,628 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:01:14,628 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 -> e0a16588b251f5de7b3febde43795c7086835cc989637b8bd82aa8d6af355c6b [2022-02-20 14:01:14,800 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:01:14,832 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:01:14,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:01:14,834 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:01:14,841 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:01:14,842 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/sanfoundry_24-1.i [2022-02-20 14:01:14,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fab147d8/2c96ec737dcc469f979f287a7f639e63/FLAG1d0ec23d6 [2022-02-20 14:01:15,254 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:01:15,255 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/sanfoundry_24-1.i [2022-02-20 14:01:15,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fab147d8/2c96ec737dcc469f979f287a7f639e63/FLAG1d0ec23d6 [2022-02-20 14:01:15,269 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fab147d8/2c96ec737dcc469f979f287a7f639e63 [2022-02-20 14:01:15,271 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:01:15,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:01:15,282 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:15,283 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:01:15,286 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:01:15,287 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,289 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c202fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15, skipping insertion in model container [2022-02-20 14:01:15,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:01:15,323 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:01:15,500 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/array-examples/sanfoundry_24-1.i[848,861] [2022-02-20 14:01:15,529 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:15,540 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:01:15,548 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/array-examples/sanfoundry_24-1.i[848,861] [2022-02-20 14:01:15,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:01:15,571 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:01:15,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15 WrapperNode [2022-02-20 14:01:15,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:01:15,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:15,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:01:15,573 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:01:15,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,604 INFO L137 Inliner]: procedures = 18, calls = 18, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 65 [2022-02-20 14:01:15,605 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:01:15,606 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:01:15,606 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:01:15,606 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:01:15,611 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,613 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,624 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:01:15,625 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:01:15,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:01:15,625 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:01:15,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (1/1) ... [2022-02-20 14:01:15,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:01:15,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:01:15,711 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:01:15,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:01:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:01:15,774 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:01:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:01:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:01:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:01:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:01:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:01:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 14:01:15,775 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 14:01:15,775 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:01:15,838 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:01:15,839 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:01:16,130 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:01:16,147 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:01:16,147 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:01:16,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16 BoogieIcfgContainer [2022-02-20 14:01:16,148 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:01:16,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:01:16,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:01:16,154 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:01:16,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:01:15" (1/3) ... [2022-02-20 14:01:16,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145b1886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:16, skipping insertion in model container [2022-02-20 14:01:16,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:01:15" (2/3) ... [2022-02-20 14:01:16,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@145b1886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:01:16, skipping insertion in model container [2022-02-20 14:01:16,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16" (3/3) ... [2022-02-20 14:01:16,156 INFO L111 eAbstractionObserver]: Analyzing ICFG sanfoundry_24-1.i [2022-02-20 14:01:16,160 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:01:16,160 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:01:16,191 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:01:16,196 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:01:16,196 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:01:16,213 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:16,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:01:16,220 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:16,221 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:16,222 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:16,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:16,226 INFO L85 PathProgramCache]: Analyzing trace with hash 1970177477, now seen corresponding path program 1 times [2022-02-20 14:01:16,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:16,237 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563220558] [2022-02-20 14:01:16,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:16,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {29#true} is VALID [2022-02-20 14:01:16,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {31#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:01:16,504 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < main_~num~0#1); {32#(<= |ULTIMATE.start_main_~num~0#1| 0)} is VALID [2022-02-20 14:01:16,505 INFO L290 TraceCheckUtils]: 3: Hoare triple {32#(<= |ULTIMATE.start_main_~num~0#1| 0)} main_~i~0#1 := 0; {33#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 0))} is VALID [2022-02-20 14:01:16,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~num~0#1| 0))} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {30#false} is VALID [2022-02-20 14:01:16,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {30#false} assume 0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline_printEven } true;printEven_#in~i#1 := main_#t~mem6#1;havoc printEven_~i#1;printEven_~i#1 := printEven_#in~i#1; {30#false} is VALID [2022-02-20 14:01:16,507 INFO L272 TraceCheckUtils]: 6: Hoare triple {30#false} call __VERIFIER_assert((if 0 == (if printEven_~i#1 < 0 && 0 != printEven_~i#1 % 2 then printEven_~i#1 % 2 - 2 else printEven_~i#1 % 2) then 1 else 0)); {30#false} is VALID [2022-02-20 14:01:16,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} ~cond := #in~cond; {30#false} is VALID [2022-02-20 14:01:16,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume 0 == ~cond; {30#false} is VALID [2022-02-20 14:01:16,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-02-20 14:01:16,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:01:16,511 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:16,511 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563220558] [2022-02-20 14:01:16,512 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563220558] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:16,512 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:16,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:01:16,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972470768] [2022-02-20 14:01:16,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:16,520 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:01:16,521 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:16,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:16,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:16,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:01:16,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:16,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:01:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:01:16,560 INFO L87 Difference]: Start difference. First operand has 26 states, 21 states have (on average 1.4761904761904763) internal successors, (31), 22 states have internal predecessors, (31), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:16,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:16,744 INFO L93 Difference]: Finished difference Result 68 states and 101 transitions. [2022-02-20 14:01:16,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:01:16,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 14:01:16,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:16,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-02-20 14:01:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:16,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 101 transitions. [2022-02-20 14:01:16,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 101 transitions. [2022-02-20 14:01:16,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:16,840 INFO L225 Difference]: With dead ends: 68 [2022-02-20 14:01:16,843 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:01:16,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:01:16,863 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:16,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 80 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:01:16,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:01:16,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 24. [2022-02-20 14:01:16,902 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:16,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:16,905 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:16,905 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:16,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:16,935 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 14:01:16,935 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 14:01:16,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:16,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:16,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-02-20 14:01:16,936 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 34 states. [2022-02-20 14:01:16,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:16,939 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-02-20 14:01:16,939 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-02-20 14:01:16,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:16,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:16,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:16,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:16,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:16,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 14:01:16,944 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 10 [2022-02-20 14:01:16,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:16,945 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 14:01:16,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:16,946 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 14:01:16,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:01:16,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:16,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:16,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:01:16,948 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:16,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:16,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1314979911, now seen corresponding path program 1 times [2022-02-20 14:01:16,949 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:16,950 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22937662] [2022-02-20 14:01:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:16,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:17,179 INFO L290 TraceCheckUtils]: 0: Hoare triple {225#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {225#true} is VALID [2022-02-20 14:01:17,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {225#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {225#true} is VALID [2022-02-20 14:01:17,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {225#true} assume !!(main_~i~0#1 < main_~num~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {225#true} is VALID [2022-02-20 14:01:17,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {225#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {225#true} is VALID [2022-02-20 14:01:17,185 INFO L290 TraceCheckUtils]: 4: Hoare triple {225#true} assume !(main_~i~0#1 < main_~num~0#1); {225#true} is VALID [2022-02-20 14:01:17,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {225#true} main_~i~0#1 := 0; {225#true} is VALID [2022-02-20 14:01:17,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {225#true} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {227#(or (not (= (+ |ULTIMATE.start_main_#t~mem5#1| (* (- 2) (div |ULTIMATE.start_main_#t~mem5#1| 2))) 0)) (= |ULTIMATE.start_main_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} is VALID [2022-02-20 14:01:17,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(or (not (= (+ |ULTIMATE.start_main_#t~mem5#1| (* (- 2) (div |ULTIMATE.start_main_#t~mem5#1| 2))) 0)) (= |ULTIMATE.start_main_#t~mem5#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4)))))} assume 0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2);havoc main_#t~mem5#1;call main_#t~mem6#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline_printEven } true;printEven_#in~i#1 := main_#t~mem6#1;havoc printEven_~i#1;printEven_~i#1 := printEven_#in~i#1; {228#(<= |ULTIMATE.start_printEven_~i#1| (* (div |ULTIMATE.start_printEven_~i#1| 2) 2))} is VALID [2022-02-20 14:01:17,189 INFO L272 TraceCheckUtils]: 8: Hoare triple {228#(<= |ULTIMATE.start_printEven_~i#1| (* (div |ULTIMATE.start_printEven_~i#1| 2) 2))} call __VERIFIER_assert((if 0 == (if printEven_~i#1 < 0 && 0 != printEven_~i#1 % 2 then printEven_~i#1 % 2 - 2 else printEven_~i#1 % 2) then 1 else 0)); {229#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 14:01:17,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {229#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {230#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 14:01:17,190 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {226#false} is VALID [2022-02-20 14:01:17,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {226#false} assume !false; {226#false} is VALID [2022-02-20 14:01:17,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:01:17,192 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:17,192 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22937662] [2022-02-20 14:01:17,192 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22937662] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:17,192 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:17,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:01:17,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399043034] [2022-02-20 14:01:17,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:17,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:01:17,195 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:17,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:17,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:01:17,206 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:17,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:01:17,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:01:17,208 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,406 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-02-20 14:01:17,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:01:17,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:01:17,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:17,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 14:01:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 45 transitions. [2022-02-20 14:01:17,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 45 transitions. [2022-02-20 14:01:17,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:17,520 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:01:17,520 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:01:17,521 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:01:17,522 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:17,523 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 130 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:01:17,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:01:17,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-02-20 14:01:17,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:17,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,542 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,543 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,545 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-02-20 14:01:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 14:01:17,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:17,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:17,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-02-20 14:01:17,546 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 37 states. [2022-02-20 14:01:17,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:17,548 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-02-20 14:01:17,548 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-02-20 14:01:17,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:17,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:17,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:17,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:17,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 14:01:17,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 14:01:17,551 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 12 [2022-02-20 14:01:17,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:17,552 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 14:01:17,552 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,552 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 14:01:17,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:01:17,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:01:17,565 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:01:17,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:01:17,565 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:01:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:01:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash -663653835, now seen corresponding path program 1 times [2022-02-20 14:01:17,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:01:17,567 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025697269] [2022-02-20 14:01:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:01:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:01:17,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:01:17,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {399#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2); {399#true} is VALID [2022-02-20 14:01:17,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {399#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet1#1, main_#t~nondet3#1, main_#t~post2#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post4#1, main_#t~mem8#1, main_#t~mem9#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~i~0#1, main_~num~0#1;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(400000);havoc main_~i~0#1;assume -2147483648 <= main_#t~nondet1#1 && main_#t~nondet1#1 <= 2147483647;main_~num~0#1 := main_#t~nondet1#1;havoc main_#t~nondet1#1;main_~i~0#1 := 0; {399#true} is VALID [2022-02-20 14:01:17,820 INFO L290 TraceCheckUtils]: 2: Hoare triple {399#true} assume !!(main_~i~0#1 < main_~num~0#1);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);havoc main_#t~nondet3#1; {399#true} is VALID [2022-02-20 14:01:17,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {399#true} main_#t~post2#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post2#1;havoc main_#t~post2#1; {399#true} is VALID [2022-02-20 14:01:17,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {399#true} assume !(main_~i~0#1 < main_~num~0#1); {399#true} is VALID [2022-02-20 14:01:17,821 INFO L290 TraceCheckUtils]: 5: Hoare triple {399#true} main_~i~0#1 := 0; {399#true} is VALID [2022-02-20 14:01:17,821 INFO L290 TraceCheckUtils]: 6: Hoare triple {399#true} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem5#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {399#true} is VALID [2022-02-20 14:01:17,821 INFO L290 TraceCheckUtils]: 7: Hoare triple {399#true} assume !(0 == (if main_#t~mem5#1 < 0 && 0 != main_#t~mem5#1 % 2 then main_#t~mem5#1 % 2 - 2 else main_#t~mem5#1 % 2));havoc main_#t~mem5#1; {399#true} is VALID [2022-02-20 14:01:17,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {399#true} main_#t~post4#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post4#1;havoc main_#t~post4#1; {399#true} is VALID [2022-02-20 14:01:17,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {399#true} assume !(main_~i~0#1 < main_~num~0#1); {399#true} is VALID [2022-02-20 14:01:17,823 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#true} main_~i~0#1 := 0; {399#true} is VALID [2022-02-20 14:01:17,824 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#true} assume !!(main_~i~0#1 < main_~num~0#1);call main_#t~mem8#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4); {401#(= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} is VALID [2022-02-20 14:01:17,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {401#(= |ULTIMATE.start_main_#t~mem8#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))))} assume 0 != (if main_#t~mem8#1 < 0 && 0 != main_#t~mem8#1 % 2 then main_#t~mem8#1 % 2 - 2 else main_#t~mem8#1 % 2);havoc main_#t~mem8#1;call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + 4 * main_~i~0#1, 4);assume { :begin_inline_printOdd } true;printOdd_#in~i#1 := main_#t~mem9#1;havoc printOdd_~i#1;printOdd_~i#1 := printOdd_#in~i#1; {402#(not (= (* (div |ULTIMATE.start_printOdd_~i#1| 2) 2) |ULTIMATE.start_printOdd_~i#1|))} is VALID [2022-02-20 14:01:17,836 INFO L272 TraceCheckUtils]: 13: Hoare triple {402#(not (= (* (div |ULTIMATE.start_printOdd_~i#1| 2) 2) |ULTIMATE.start_printOdd_~i#1|))} call __VERIFIER_assert((if 0 != (if printOdd_~i#1 < 0 && 0 != printOdd_~i#1 % 2 then printOdd_~i#1 % 2 - 2 else printOdd_~i#1 % 2) then 1 else 0)); {403#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-02-20 14:01:17,837 INFO L290 TraceCheckUtils]: 14: Hoare triple {403#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {404#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-02-20 14:01:17,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {404#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {400#false} is VALID [2022-02-20 14:01:17,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {400#false} assume !false; {400#false} is VALID [2022-02-20 14:01:17,838 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:01:17,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:01:17,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025697269] [2022-02-20 14:01:17,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025697269] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:01:17,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:01:17,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:01:17,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911194304] [2022-02-20 14:01:17,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:01:17,839 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:01:17,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:01:17,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:17,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:17,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:01:17,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:01:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:01:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:01:17,865 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,060 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 14:01:18,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:01:18,063 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:01:18,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:01:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-20 14:01:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 34 transitions. [2022-02-20 14:01:18,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 34 transitions. [2022-02-20 14:01:18,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:01:18,121 INFO L225 Difference]: With dead ends: 31 [2022-02-20 14:01:18,121 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:01:18,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 14:01:18,128 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 7 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:01:18,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:01:18,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:01:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:01:18,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:01:18,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,133 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,133 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,134 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:01:18,134 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:01:18,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:18,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:18,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:01:18,134 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:01:18,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:01:18,147 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:01:18,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:01:18,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:18,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:01:18,148 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:01:18,148 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:01:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:01:18,149 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2022-02-20 14:01:18,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:01:18,149 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:01:18,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:01:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:01:18,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:01:18,154 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:01:18,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:01:18,156 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:01:18,198 INFO L858 garLoopResultBuilder]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L861 garLoopResultBuilder]: At program point L27-3(lines 27 30) the Hoare annotation is: true [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L27-4(lines 27 30) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (not (= (* (div |ULTIMATE.start_printOdd_~i#1| 2) 2) |ULTIMATE.start_printOdd_~i#1|)) [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L19-1(lines 18 20) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L32-2(lines 32 38) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L861 garLoopResultBuilder]: At program point L32-3(lines 32 38) the Hoare annotation is: true [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L32-4(lines 32 38) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L854 garLoopResultBuilder]: At program point L16(line 16) the Hoare annotation is: (<= |ULTIMATE.start_printEven_~i#1| (* (div |ULTIMATE.start_printEven_~i#1| 2) 2)) [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L16-1(lines 15 17) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L41(lines 41 44) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L861 garLoopResultBuilder]: At program point L46(lines 21 47) the Hoare annotation is: true [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L34(lines 34 37) no Hoare annotation was computed. [2022-02-20 14:01:18,199 INFO L858 garLoopResultBuilder]: For program point L39-2(lines 39 45) no Hoare annotation was computed. [2022-02-20 14:01:18,200 INFO L861 garLoopResultBuilder]: At program point L39-3(lines 39 45) the Hoare annotation is: true [2022-02-20 14:01:18,200 INFO L858 garLoopResultBuilder]: For program point L39-4(lines 39 45) no Hoare annotation was computed. [2022-02-20 14:01:18,200 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 14) the Hoare annotation is: true [2022-02-20 14:01:18,200 INFO L858 garLoopResultBuilder]: For program point L14(line 14) no Hoare annotation was computed. [2022-02-20 14:01:18,200 INFO L858 garLoopResultBuilder]: For program point L14-1(line 14) no Hoare annotation was computed. [2022-02-20 14:01:18,200 INFO L858 garLoopResultBuilder]: For program point L14-3(line 14) no Hoare annotation was computed. [2022-02-20 14:01:18,200 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(line 14) no Hoare annotation was computed. [2022-02-20 14:01:18,200 INFO L858 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-02-20 14:01:18,202 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 14:01:18,203 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:01:18,206 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:01:18,206 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 14:01:18,206 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:01:18,206 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 14:01:18,206 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2022-02-20 14:01:18,206 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L14-1 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L14-3 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L27-4 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L27-2 has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-02-20 14:01:18,207 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L32-4 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L32-2 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L39-2 has no Hoare annotation [2022-02-20 14:01:18,208 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: L16-1 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: L39-4 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: L19-1 has no Hoare annotation [2022-02-20 14:01:18,209 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:01:18,210 INFO L163 areAnnotationChecker]: CFG has 2 edges. 2 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:01:18,214 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:01:18 BoogieIcfgContainer [2022-02-20 14:01:18,214 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:01:18,215 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:01:18,215 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:01:18,215 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:01:18,216 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:01:16" (3/4) ... [2022-02-20 14:01:18,218 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:01:18,222 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2022-02-20 14:01:18,226 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2022-02-20 14:01:18,226 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-02-20 14:01:18,226 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:01:18,226 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:01:18,290 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:01:18,290 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:01:18,291 INFO L158 Benchmark]: Toolchain (without parser) took 3018.32ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 84.3MB in the beginning and 82.8MB in the end (delta: 1.5MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2022-02-20 14:01:18,291 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:01:18,292 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.32ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 88.4MB in the end (delta: -4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 14:01:18,292 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.35ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 86.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:01:18,292 INFO L158 Benchmark]: Boogie Preprocessor took 18.47ms. Allocated memory is still 113.2MB. Free memory was 86.7MB in the beginning and 85.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:01:18,292 INFO L158 Benchmark]: RCFGBuilder took 523.33ms. Allocated memory is still 113.2MB. Free memory was 85.4MB in the beginning and 72.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:01:18,293 INFO L158 Benchmark]: TraceAbstraction took 2063.54ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 72.4MB in the beginning and 85.8MB in the end (delta: -13.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. [2022-02-20 14:01:18,293 INFO L158 Benchmark]: Witness Printer took 75.30ms. Allocated memory is still 148.9MB. Free memory was 85.8MB in the beginning and 82.8MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:01:18,294 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 113.2MB. Free memory was 68.4MB in the beginning and 68.3MB in the end (delta: 29.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.32ms. Allocated memory is still 113.2MB. Free memory was 84.0MB in the beginning and 88.4MB in the end (delta: -4.5MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.35ms. Allocated memory is still 113.2MB. Free memory was 88.4MB in the beginning and 86.7MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 18.47ms. Allocated memory is still 113.2MB. Free memory was 86.7MB in the beginning and 85.4MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 523.33ms. Allocated memory is still 113.2MB. Free memory was 85.4MB in the beginning and 72.8MB in the end (delta: 12.5MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2063.54ms. Allocated memory was 113.2MB in the beginning and 148.9MB in the end (delta: 35.7MB). Free memory was 72.4MB in the beginning and 85.8MB in the end (delta: -13.4MB). Peak memory consumption was 23.8MB. Max. memory is 16.1GB. * Witness Printer took 75.30ms. Allocated memory is still 148.9MB. Free memory was 85.8MB in the beginning and 82.8MB in the end (delta: 3.0MB). 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 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.0s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 38 mSDsluCounter, 309 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 228 mSDsCounter, 12 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 143 IncrementalHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 12 mSolverCounterUnsat, 81 mSDtfsCounter, 143 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=28occurred in iteration=2, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 19 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 10 PreInvPairs, 21 NumberOfFragments, 20 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 39 NumberOfCodeBlocks, 39 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 36 ConstructedInterpolants, 0 QuantifiedInterpolants, 102 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 3/3 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: 1 RESULT: Ultimate proved your program to be correct! [2022-02-20 14:01:18,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE