./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gsv2008.c.i.v+lhb-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/loop-lit/gsv2008.c.i.v+lhb-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f79720b54b4b9430b2efff386b59c4cac88edea0ef8f0ba223c5daccad25b87 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:04:10,375 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:04:10,377 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:04:10,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:04:10,412 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:04:10,416 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:04:10,418 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:04:10,425 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:04:10,427 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:04:10,433 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:04:10,434 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:04:10,435 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:04:10,435 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:04:10,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:04:10,439 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:04:10,441 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:04:10,441 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:04:10,442 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:04:10,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:04:10,444 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:04:10,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:04:10,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:04:10,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:04:10,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:04:10,453 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:04:10,454 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:04:10,454 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:04:10,456 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:04:10,456 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:04:10,457 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:04:10,458 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:04:10,458 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:04:10,460 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:04:10,461 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:04:10,462 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:04:10,463 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:04:10,463 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:04:10,463 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:04:10,464 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:04:10,464 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:04:10,465 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:04:10,466 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:04:10,503 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:04:10,503 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:04:10,504 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:04:10,504 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:04:10,505 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:04:10,505 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:04:10,505 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:04:10,506 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:04:10,506 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:04:10,506 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:04:10,507 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:04:10,507 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:04:10,507 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:04:10,508 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:04:10,508 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:04:10,508 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:04:10,508 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:04:10,508 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:04:10,508 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:04:10,509 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:04:10,509 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:04:10,509 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:04:10,509 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:04:10,509 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:04:10,510 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:10,510 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:04:10,510 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:04:10,510 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:04:10,510 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:04:10,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:04:10,511 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:04:10,511 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:04:10,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:04:10,511 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 -> 2f79720b54b4b9430b2efff386b59c4cac88edea0ef8f0ba223c5daccad25b87 [2022-02-20 17:04:10,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:04:10,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:04:10,757 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:04:10,758 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:04:10,759 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:04:10,760 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2022-02-20 17:04:10,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c5569a8/50236eb1519c446fa1bbb21823a1fc96/FLAG4c830aa33 [2022-02-20 17:04:11,228 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:04:11,229 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gsv2008.c.i.v+lhb-reducer.c [2022-02-20 17:04:11,238 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c5569a8/50236eb1519c446fa1bbb21823a1fc96/FLAG4c830aa33 [2022-02-20 17:04:11,251 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39c5569a8/50236eb1519c446fa1bbb21823a1fc96 [2022-02-20 17:04:11,253 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:04:11,256 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:04:11,258 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:11,258 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:04:11,261 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:04:11,264 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,265 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3314fbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11, skipping insertion in model container [2022-02-20 17:04:11,266 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,271 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:04:11,287 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:04:11,470 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/loop-lit/gsv2008.c.i.v+lhb-reducer.c[1238,1251] [2022-02-20 17:04:11,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:11,499 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:04:11,520 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/loop-lit/gsv2008.c.i.v+lhb-reducer.c[1238,1251] [2022-02-20 17:04:11,522 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:04:11,532 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:04:11,533 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11 WrapperNode [2022-02-20 17:04:11,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:04:11,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:11,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:04:11,535 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:04:11,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,546 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,563 INFO L137 Inliner]: procedures = 14, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2022-02-20 17:04:11,564 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:04:11,565 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:04:11,565 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:04:11,565 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:04:11,571 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,574 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,586 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,586 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,587 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:04:11,588 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:04:11,588 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:04:11,589 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:04:11,589 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (1/1) ... [2022-02-20 17:04:11,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:04:11,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:11,624 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 17:04:11,626 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 17:04:11,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:04:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:04:11,654 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:04:11,654 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:04:11,709 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:04:11,711 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:04:11,861 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:04:11,866 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:04:11,866 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-02-20 17:04:11,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:11 BoogieIcfgContainer [2022-02-20 17:04:11,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:04:11,870 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:04:11,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:04:11,872 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:04:11,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:04:11" (1/3) ... [2022-02-20 17:04:11,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a135ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:04:11, skipping insertion in model container [2022-02-20 17:04:11,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:04:11" (2/3) ... [2022-02-20 17:04:11,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1a135ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:04:11, skipping insertion in model container [2022-02-20 17:04:11,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:11" (3/3) ... [2022-02-20 17:04:11,875 INFO L111 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.v+lhb-reducer.c [2022-02-20 17:04:11,879 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:04:11,880 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:04:11,927 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:04:11,934 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 17:04:11,935 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:04:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 17:04:11,969 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:04:11,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:04:11,971 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:04:11,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:04:11,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1269629357, now seen corresponding path program 1 times [2022-02-20 17:04:11,985 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:04:11,986 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218353245] [2022-02-20 17:04:11,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:11,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:04:12,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:12,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {16#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {16#true} is VALID [2022-02-20 17:04:12,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {16#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {18#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:12,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {18#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(-1000 < main_~main__y~0#1); {18#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:12,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {18#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(main_~main__y~0#1 < 1000000); {18#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:12,247 INFO L290 TraceCheckUtils]: 4: Hoare triple {18#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~0#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1;~__tmp_55_0~0 := main_~main____CPAchecker_TMP_0~0#1; {19#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:12,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_55_0~0; {19#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:12,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {20#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 17:04:12,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {17#false} is VALID [2022-02-20 17:04:12,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {17#false} assume !false; {17#false} is VALID [2022-02-20 17:04:12,250 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 17:04:12,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:04:12,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218353245] [2022-02-20 17:04:12,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218353245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:04:12,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:04:12,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 17:04:12,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806778445] [2022-02-20 17:04:12,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:04:12,258 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:04:12,259 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:04:12,262 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), 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 17:04:12,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:12,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:04:12,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:04:12,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:04:12,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 17:04:12,294 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.5454545454545454) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 5 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:12,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:12,406 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2022-02-20 17:04:12,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 17:04:12,406 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 17:04:12,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:04:12,408 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), 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 17:04:12,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 17:04:12,414 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), 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 17:04:12,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 32 transitions. [2022-02-20 17:04:12,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 32 transitions. [2022-02-20 17:04:12,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:12,452 INFO L225 Difference]: With dead ends: 30 [2022-02-20 17:04:12,453 INFO L226 Difference]: Without dead ends: 12 [2022-02-20 17:04:12,455 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:04:12,458 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:04:12,459 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 41 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:04:12,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2022-02-20 17:04:12,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2022-02-20 17:04:12,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:04:12,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:12,483 INFO L74 IsIncluded]: Start isIncluded. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:12,484 INFO L87 Difference]: Start difference. First operand 12 states. Second operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:12,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:12,485 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-20 17:04:12,485 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-20 17:04:12,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:12,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:12,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 17:04:12,487 INFO L87 Difference]: Start difference. First operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 12 states. [2022-02-20 17:04:12,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:12,488 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-20 17:04:12,488 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-20 17:04:12,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:12,488 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:12,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:04:12,489 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:04:12,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:12,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-02-20 17:04:12,491 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-02-20 17:04:12,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:04:12,492 INFO L470 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-02-20 17:04:12,492 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), 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 17:04:12,492 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-02-20 17:04:12,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 17:04:12,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:04:12,493 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:04:12,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:04:12,494 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:04:12,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:04:12,495 INFO L85 PathProgramCache]: Analyzing trace with hash 341011600, now seen corresponding path program 1 times [2022-02-20 17:04:12,495 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:04:12,495 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670309559] [2022-02-20 17:04:12,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:12,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:04:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:12,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {102#true} is VALID [2022-02-20 17:04:12,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:12,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(-1000 < main_~main__y~0#1); {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:12,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(main_~main__y~0#1 < 1000000); {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:12,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~0#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1;~__tmp_55_0~0 := main_~main____CPAchecker_TMP_0~0#1; {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:12,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_55_0~0; {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:12,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~1#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1;~__tmp_55_0~0 := main_~main____CPAchecker_TMP_0~1#1; {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} is VALID [2022-02-20 17:04:12,583 INFO L290 TraceCheckUtils]: 7: Hoare triple {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_55_0~0; {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} is VALID [2022-02-20 17:04:12,584 INFO L290 TraceCheckUtils]: 8: Hoare triple {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {107#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} is VALID [2022-02-20 17:04:12,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {107#(not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0))} assume 0 == main_~__VERIFIER_assert__cond~0#1; {103#false} is VALID [2022-02-20 17:04:12,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {103#false} assume !false; {103#false} is VALID [2022-02-20 17:04:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:12,585 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:04:12,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670309559] [2022-02-20 17:04:12,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670309559] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:04:12,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815308436] [2022-02-20 17:04:12,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:04:12,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:04:12,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:04:12,595 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:04:12,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:04:12,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:12,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 17:04:12,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:04:12,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:04:13,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {102#true} is VALID [2022-02-20 17:04:13,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:13,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(-1000 < main_~main__y~0#1); {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:13,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume !!(main_~main__y~0#1 < 1000000); {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} is VALID [2022-02-20 17:04:13,032 INFO L290 TraceCheckUtils]: 4: Hoare triple {104#(<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~0#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1;~__tmp_55_0~0 := main_~main____CPAchecker_TMP_0~0#1; {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:13,032 INFO L290 TraceCheckUtils]: 5: Hoare triple {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_55_0~0; {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} is VALID [2022-02-20 17:04:13,033 INFO L290 TraceCheckUtils]: 6: Hoare triple {105#(<= (+ 51 |ULTIMATE.start_main_~main__x~0#1|) |ULTIMATE.start_main_~main__y~0#1|)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~1#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1;~__tmp_55_0~0 := main_~main____CPAchecker_TMP_0~1#1; {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} is VALID [2022-02-20 17:04:13,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_55_0~0; {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} is VALID [2022-02-20 17:04:13,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {106#(<= (+ 53 |ULTIMATE.start_main_~main__x~0#1|) (* 2 |ULTIMATE.start_main_~main__y~0#1|))} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {135#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} is VALID [2022-02-20 17:04:13,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} assume 0 == main_~__VERIFIER_assert__cond~0#1; {103#false} is VALID [2022-02-20 17:04:13,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {103#false} assume !false; {103#false} is VALID [2022-02-20 17:04:13,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:13,036 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:04:13,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {103#false} assume !false; {103#false} is VALID [2022-02-20 17:04:13,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {135#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} assume 0 == main_~__VERIFIER_assert__cond~0#1; {103#false} is VALID [2022-02-20 17:04:13,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {148#(or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0))} assume !(main_~main__x~0#1 < 0);havoc main_~__tmp_1~0#1;main_~__tmp_1~0#1 := (if main_~main__y~0#1 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0#1;main_~__VERIFIER_assert__cond~0#1 := main_~__tmp_1~0#1; {135#(<= 1 |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1|)} is VALID [2022-02-20 17:04:13,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {148#(or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_55_0~0; {148#(or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0))} is VALID [2022-02-20 17:04:13,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {155#(or (< (+ |ULTIMATE.start_main_~main__x~0#1| |ULTIMATE.start_main_~main__y~0#1|) 0) (< 0 (+ |ULTIMATE.start_main_~main__y~0#1| 1)))} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~1#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1;~__tmp_55_0~0 := main_~main____CPAchecker_TMP_0~1#1; {148#(or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0))} is VALID [2022-02-20 17:04:13,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {155#(or (< (+ |ULTIMATE.start_main_~main__x~0#1| |ULTIMATE.start_main_~main__y~0#1|) 0) (< 0 (+ |ULTIMATE.start_main_~main__y~0#1| 1)))} main_~main____CPAchecker_TMP_0~0#1 := ~__tmp_55_0~0; {155#(or (< (+ |ULTIMATE.start_main_~main__x~0#1| |ULTIMATE.start_main_~main__y~0#1|) 0) (< 0 (+ |ULTIMATE.start_main_~main__y~0#1| 1)))} is VALID [2022-02-20 17:04:13,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {162#(< |ULTIMATE.start_main_~main__x~0#1| 3)} assume main_~main__x~0#1 < 0;main_~main__x~0#1 := main_~main__x~0#1 + main_~main__y~0#1;main_~main____CPAchecker_TMP_0~0#1 := main_~main__y~0#1;main_~main__y~0#1 := 1 + main_~main__y~0#1;~__tmp_55_0~0 := main_~main____CPAchecker_TMP_0~0#1; {155#(or (< (+ |ULTIMATE.start_main_~main__x~0#1| |ULTIMATE.start_main_~main__y~0#1|) 0) (< 0 (+ |ULTIMATE.start_main_~main__y~0#1| 1)))} is VALID [2022-02-20 17:04:13,294 INFO L290 TraceCheckUtils]: 3: Hoare triple {162#(< |ULTIMATE.start_main_~main__x~0#1| 3)} assume !!(main_~main__y~0#1 < 1000000); {162#(< |ULTIMATE.start_main_~main__x~0#1| 3)} is VALID [2022-02-20 17:04:13,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#(< |ULTIMATE.start_main_~main__x~0#1| 3)} assume !!(-1000 < main_~main__y~0#1); {162#(< |ULTIMATE.start_main_~main__x~0#1| 3)} is VALID [2022-02-20 17:04:13,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {102#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_~main____CPAchecker_TMP_0~1#1, main_~__tmp_1~0#1, main_~__VERIFIER_assert__cond~0#1, main_~main____CPAchecker_TMP_0~0#1, main_~main__x~0#1, main_~main__y~0#1;havoc main_~main__x~0#1;havoc main_~main__y~0#1;main_~main__x~0#1 := -50;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~main__y~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {162#(< |ULTIMATE.start_main_~main__x~0#1| 3)} is VALID [2022-02-20 17:04:13,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {102#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(28, 2);call #Ultimate.allocInit(12, 3);~__return_main~0 := 0;~__tmp_55_0~0 := 0;~__return_65~0 := 0; {102#true} is VALID [2022-02-20 17:04:13,296 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:04:13,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815308436] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:04:13,296 INFO L191 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-02-20 17:04:13,296 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 10 [2022-02-20 17:04:13,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192111390] [2022-02-20 17:04:13,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:04:13,298 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:04:13,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:04:13,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:13,308 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:04:13,308 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 17:04:13,308 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:04:13,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 17:04:13,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:04:13,309 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:13,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:13,384 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2022-02-20 17:04:13,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:04:13,385 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 17:04:13,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:04:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-20 17:04:13,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2022-02-20 17:04:13,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 10 transitions. [2022-02-20 17:04:13,396 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 17:04:13,396 INFO L225 Difference]: With dead ends: 12 [2022-02-20 17:04:13,396 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 17:04:13,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:04:13,397 INFO L933 BasicCegarLoop]: 3 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:04:13,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 9 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:04:13,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 17:04:13,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 17:04:13,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:04:13,399 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 17:04:13,399 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 17:04:13,399 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 17:04:13,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:13,399 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:04:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:13,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:13,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:13,400 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 17:04:13,400 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 17:04:13,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:04:13,400 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 17:04:13,400 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:13,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:13,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:04:13,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:04:13,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:04:13,401 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 17:04:13,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 17:04:13,401 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-02-20 17:04:13,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:04:13,401 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 17:04:13,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 17:04:13,402 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 17:04:13,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:04:13,404 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:04:13,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:04:13,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:04:13,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 17:04:13,654 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 17:04:13,655 INFO L854 garLoopResultBuilder]: At program point L46(lines 33 67) the Hoare annotation is: (or (< 0 |ULTIMATE.start_main_~main__y~0#1|) (< |ULTIMATE.start_main_~main__x~0#1| 0)) [2022-02-20 17:04:13,655 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 66) no Hoare annotation was computed. [2022-02-20 17:04:13,655 INFO L858 garLoopResultBuilder]: For program point L32(lines 32 71) no Hoare annotation was computed. [2022-02-20 17:04:13,655 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 17:04:13,655 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 17:04:13,656 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 17:04:13,656 INFO L858 garLoopResultBuilder]: For program point L26(lines 26 72) no Hoare annotation was computed. [2022-02-20 17:04:13,656 INFO L858 garLoopResultBuilder]: For program point L57(line 57) no Hoare annotation was computed. [2022-02-20 17:04:13,656 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 57) no Hoare annotation was computed. [2022-02-20 17:04:13,656 INFO L858 garLoopResultBuilder]: For program point L55(lines 55 64) no Hoare annotation was computed. [2022-02-20 17:04:13,656 INFO L858 garLoopResultBuilder]: For program point L20(lines 20 73) no Hoare annotation was computed. [2022-02-20 17:04:13,656 INFO L854 garLoopResultBuilder]: At program point L70(lines 14 74) the Hoare annotation is: (or (not (= |ULTIMATE.start_main_~__VERIFIER_assert__cond~0#1| 0)) (<= (+ |ULTIMATE.start_main_~main__x~0#1| 50) 0)) [2022-02-20 17:04:13,659 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1] [2022-02-20 17:04:13,660 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:04:13,664 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 17:04:13,664 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 17:04:13,664 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 17:04:13,664 WARN L170 areAnnotationChecker]: L20 has no Hoare annotation [2022-02-20 17:04:13,664 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:04:13,664 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 17:04:13,664 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L32 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L55 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 17:04:13,665 WARN L170 areAnnotationChecker]: L57 has no Hoare annotation [2022-02-20 17:04:13,665 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 17:04:13,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 05:04:13 BoogieIcfgContainer [2022-02-20 17:04:13,672 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 17:04:13,673 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 17:04:13,673 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 17:04:13,673 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 17:04:13,673 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:04:11" (3/4) ... [2022-02-20 17:04:13,676 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 17:04:13,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 17:04:13,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 17:04:13,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 17:04:13,683 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 17:04:13,711 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 17:04:13,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 17:04:13,712 INFO L158 Benchmark]: Toolchain (without parser) took 2456.00ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 57.1MB in the beginning and 43.7MB in the end (delta: 13.4MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2022-02-20 17:04:13,712 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 96.5MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:04:13,713 INFO L158 Benchmark]: CACSL2BoogieTranslator took 275.66ms. Allocated memory is still 96.5MB. Free memory was 56.8MB in the beginning and 69.8MB in the end (delta: -13.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. [2022-02-20 17:04:13,713 INFO L158 Benchmark]: Boogie Procedure Inliner took 30.18ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 68.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:04:13,713 INFO L158 Benchmark]: Boogie Preprocessor took 22.87ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 67.2MB in the end (delta: 945.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:04:13,714 INFO L158 Benchmark]: RCFGBuilder took 280.12ms. Allocated memory is still 96.5MB. Free memory was 67.2MB in the beginning and 56.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:04:13,714 INFO L158 Benchmark]: TraceAbstraction took 1802.61ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.3MB in the beginning and 45.8MB in the end (delta: 10.5MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. [2022-02-20 17:04:13,714 INFO L158 Benchmark]: Witness Printer took 38.16ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 43.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:04:13,716 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.18ms. Allocated memory is still 96.5MB. Free memory is still 73.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 275.66ms. Allocated memory is still 96.5MB. Free memory was 56.8MB in the beginning and 69.8MB in the end (delta: -13.0MB). Peak memory consumption was 8.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 30.18ms. Allocated memory is still 96.5MB. Free memory was 69.6MB in the beginning and 68.1MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 22.87ms. Allocated memory is still 96.5MB. Free memory was 68.1MB in the beginning and 67.2MB in the end (delta: 945.1kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 280.12ms. Allocated memory is still 96.5MB. Free memory was 67.2MB in the beginning and 56.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1802.61ms. Allocated memory was 96.5MB in the beginning and 117.4MB in the end (delta: 21.0MB). Free memory was 56.3MB in the beginning and 45.8MB in the end (delta: 10.5MB). Peak memory consumption was 34.2MB. Max. memory is 16.1GB. * Witness Printer took 38.16ms. Allocated memory is still 117.4MB. Free memory was 45.8MB in the beginning and 43.7MB in the end (delta: 2.1MB). 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: 57]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.7s, OverallIterations: 2, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 18 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 18 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 32 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 18 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=13occurred in iteration=0, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 17 HoareAnnotationTreeSize, 2 FomulaSimplifications, 21 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 13 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 38 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 4 NumberOfNonLiveVariables, 67 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 4 InterpolantComputations, 2 PerfectInterpolantSequences, 2/6 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: 33]: Loop Invariant Derived loop invariant: 0 < main__y || main__x < 0 - InvariantResult [Line: 14]: Loop Invariant Derived loop invariant: !(__VERIFIER_assert__cond == 0) || main__x + 50 <= 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 17:04:13,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE