./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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.p+cfa-reducer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6c42a95d16e26b79b00ebfef176d8ec23715bad8 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:16:54,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:16:54,828 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:16:54,841 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:16:54,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:16:54,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:16:54,844 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:16:54,846 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:16:54,848 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:16:54,849 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:16:54,850 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:16:54,853 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:16:54,855 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:16:54,857 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:16:54,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:16:54,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:16:54,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:16:54,865 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:16:54,867 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:16:54,872 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:16:54,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:16:54,875 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:16:54,876 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:16:54,878 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:16:54,884 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:16:54,885 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:16:54,885 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:16:54,887 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:16:54,887 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:16:54,888 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:16:54,888 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:16:54,890 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:16:54,891 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:16:54,894 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:16:54,897 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:16:54,897 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:16:54,898 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:16:54,898 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:16:54,898 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:16:54,899 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:16:54,901 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:16:54,902 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:16:54,925 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:16:54,926 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:16:54,927 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:16:54,927 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:16:54,928 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:16:54,928 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:16:54,928 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:16:54,928 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:16:54,929 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:16:54,929 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:16:54,930 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:16:54,930 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:16:54,930 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:16:54,931 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:16:54,931 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:16:54,931 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:16:54,931 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:16:54,932 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:16:54,932 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:16:54,932 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:16:54,932 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:16:54,933 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:16:54,933 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:16:54,933 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:16:54,933 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:16:54,933 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:16:54,934 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:16:54,934 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:16:54,934 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:16:54,934 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 6c42a95d16e26b79b00ebfef176d8ec23715bad8 [2020-07-28 18:16:55,302 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:16:55,316 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:16:55,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:16:55,321 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:16:55,321 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:16:55,322 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2020-07-28 18:16:55,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391715698/79402e3f6e22450bb8ff40b68decaec2/FLAG5fa7c486a [2020-07-28 18:16:55,908 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:16:55,909 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-lit/gsv2008.c.i.p+cfa-reducer.c [2020-07-28 18:16:55,916 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391715698/79402e3f6e22450bb8ff40b68decaec2/FLAG5fa7c486a [2020-07-28 18:16:56,283 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/391715698/79402e3f6e22450bb8ff40b68decaec2 [2020-07-28 18:16:56,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:16:56,291 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:16:56,292 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:56,292 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:16:56,296 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:16:56,298 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,301 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a9f19d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56, skipping insertion in model container [2020-07-28 18:16:56,301 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:16:56,330 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:16:56,568 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:56,578 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:16:56,596 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:16:56,611 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:16:56,611 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56 WrapperNode [2020-07-28 18:16:56,611 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:16:56,612 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:56,612 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:16:56,612 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:16:56,621 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,627 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,703 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:16:56,703 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:16:56,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:16:56,704 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:16:56,711 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,711 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,712 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,715 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,718 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... [2020-07-28 18:16:56,720 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:16:56,720 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:16:56,720 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:16:56,720 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:16:56,721 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:16:56,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:16:56,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:16:57,004 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:16:57,005 INFO L295 CfgBuilder]: Removed 4 assume(true) statements. [2020-07-28 18:16:57,008 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:57 BoogieIcfgContainer [2020-07-28 18:16:57,008 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:16:57,010 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:16:57,010 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:16:57,014 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:16:57,014 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:16:56" (1/3) ... [2020-07-28 18:16:57,015 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b67da47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:57, skipping insertion in model container [2020-07-28 18:16:57,015 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:16:56" (2/3) ... [2020-07-28 18:16:57,016 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b67da47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:16:57, skipping insertion in model container [2020-07-28 18:16:57,016 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:57" (3/3) ... [2020-07-28 18:16:57,018 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.p+cfa-reducer.c [2020-07-28 18:16:57,032 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:16:57,043 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:16:57,061 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:16:57,092 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:16:57,092 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:16:57,092 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:16:57,092 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:16:57,092 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:16:57,092 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:16:57,093 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:16:57,093 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:16:57,111 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states. [2020-07-28 18:16:57,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 18:16:57,118 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:57,120 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:57,120 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:57,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1806908747, now seen corresponding path program 1 times [2020-07-28 18:16:57,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:57,139 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036336973] [2020-07-28 18:16:57,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:57,326 INFO L280 TraceCheckUtils]: 0: Hoare triple {14#true} ~__return_main~0 := 0;~__return_144~0 := 0; {14#true} is VALID [2020-07-28 18:16:57,328 INFO L280 TraceCheckUtils]: 1: Hoare triple {14#true} havoc main_#res;havoc main_#t~nondet0, main_~main____CPAchecker_TMP_0~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0;havoc main_~main__x~0;havoc main_~main__y~0;main_~main__x~0 := -50;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__y~0 := main_#t~nondet0;havoc main_#t~nondet0; {16#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:57,329 INFO L280 TraceCheckUtils]: 2: Hoare triple {16#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(-1000 < main_~main__y~0); {16#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:57,331 INFO L280 TraceCheckUtils]: 3: Hoare triple {16#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(main_~main__y~0 < 1000000); {16#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:57,332 INFO L280 TraceCheckUtils]: 4: Hoare triple {16#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !(main_~main__x~0 < 0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if main_~main__y~0 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {15#false} is VALID [2020-07-28 18:16:57,333 INFO L280 TraceCheckUtils]: 5: Hoare triple {15#false} assume 0 == main_~__VERIFIER_assert__cond~0; {15#false} is VALID [2020-07-28 18:16:57,333 INFO L280 TraceCheckUtils]: 6: Hoare triple {15#false} assume !false; {15#false} is VALID [2020-07-28 18:16:57,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:57,336 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036336973] [2020-07-28 18:16:57,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:16:57,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:16:57,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037279037] [2020-07-28 18:16:57,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 18:16:57,347 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:57,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:16:57,375 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:57,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:16:57,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:57,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:16:57,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:16:57,389 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 3 states. [2020-07-28 18:16:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:57,456 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2020-07-28 18:16:57,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:16:57,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 18:16:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:57,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:16:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-07-28 18:16:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:16:57,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 24 transitions. [2020-07-28 18:16:57,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 24 transitions. [2020-07-28 18:16:57,517 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:57,529 INFO L225 Difference]: With dead ends: 21 [2020-07-28 18:16:57,529 INFO L226 Difference]: Without dead ends: 9 [2020-07-28 18:16:57,533 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:16:57,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2020-07-28 18:16:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2020-07-28 18:16:57,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:57,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:57,578 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:57,578 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:57,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:57,581 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:16:57,581 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:16:57,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:57,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:57,582 INFO L74 IsIncluded]: Start isIncluded. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:57,582 INFO L87 Difference]: Start difference. First operand 9 states. Second operand 9 states. [2020-07-28 18:16:57,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:57,584 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2020-07-28 18:16:57,584 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:16:57,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:57,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:57,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:57,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:57,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-28 18:16:57,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2020-07-28 18:16:57,589 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2020-07-28 18:16:57,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:57,590 INFO L479 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2020-07-28 18:16:57,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:16:57,590 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2020-07-28 18:16:57,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2020-07-28 18:16:57,591 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:57,591 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:57,592 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:16:57,592 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:57,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:57,593 INFO L82 PathProgramCache]: Analyzing trace with hash 179533835, now seen corresponding path program 1 times [2020-07-28 18:16:57,593 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:57,594 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579562415] [2020-07-28 18:16:57,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:57,717 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~__return_main~0 := 0;~__return_144~0 := 0; {74#true} is VALID [2020-07-28 18:16:57,720 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} havoc main_#res;havoc main_#t~nondet0, main_~main____CPAchecker_TMP_0~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0;havoc main_~main__x~0;havoc main_~main__y~0;main_~main__x~0 := -50;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__y~0 := main_#t~nondet0;havoc main_#t~nondet0; {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:57,722 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(-1000 < main_~main__y~0); {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:57,724 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(main_~main__y~0 < 1000000); {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:57,726 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {77#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} is VALID [2020-07-28 18:16:57,728 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} assume !(main_~main__x~0 < 0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if main_~main__y~0 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {78#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-28 18:16:57,729 INFO L280 TraceCheckUtils]: 6: Hoare triple {78#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} assume 0 == main_~__VERIFIER_assert__cond~0; {75#false} is VALID [2020-07-28 18:16:57,731 INFO L280 TraceCheckUtils]: 7: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-28 18:16:57,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:57,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579562415] [2020-07-28 18:16:57,733 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269047551] [2020-07-28 18:16:57,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:16:57,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:57,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-28 18:16:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:57,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:58,150 INFO L280 TraceCheckUtils]: 0: Hoare triple {74#true} ~__return_main~0 := 0;~__return_144~0 := 0; {74#true} is VALID [2020-07-28 18:16:58,151 INFO L280 TraceCheckUtils]: 1: Hoare triple {74#true} havoc main_#res;havoc main_#t~nondet0, main_~main____CPAchecker_TMP_0~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0;havoc main_~main__x~0;havoc main_~main__y~0;main_~main__x~0 := -50;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__y~0 := main_#t~nondet0;havoc main_#t~nondet0; {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:58,153 INFO L280 TraceCheckUtils]: 2: Hoare triple {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(-1000 < main_~main__y~0); {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:58,154 INFO L280 TraceCheckUtils]: 3: Hoare triple {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(main_~main__y~0 < 1000000); {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:58,156 INFO L280 TraceCheckUtils]: 4: Hoare triple {76#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {77#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} is VALID [2020-07-28 18:16:58,158 INFO L280 TraceCheckUtils]: 5: Hoare triple {77#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} assume !(main_~main__x~0 < 0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if main_~main__y~0 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {97#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-28 18:16:58,159 INFO L280 TraceCheckUtils]: 6: Hoare triple {97#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {75#false} is VALID [2020-07-28 18:16:58,159 INFO L280 TraceCheckUtils]: 7: Hoare triple {75#false} assume !false; {75#false} is VALID [2020-07-28 18:16:58,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:58,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:16:58,161 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-07-28 18:16:58,163 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486779485] [2020-07-28 18:16:58,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-28 18:16:58,164 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:58,164 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-28 18:16:58,181 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:58,181 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-28 18:16:58,181 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:58,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-28 18:16:58,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2020-07-28 18:16:58,182 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2020-07-28 18:16:58,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:58,288 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2020-07-28 18:16:58,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 18:16:58,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2020-07-28 18:16:58,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:58,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:16:58,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-28 18:16:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-28 18:16:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-07-28 18:16:58,292 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 13 transitions. [2020-07-28 18:16:58,316 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:58,317 INFO L225 Difference]: With dead ends: 13 [2020-07-28 18:16:58,317 INFO L226 Difference]: Without dead ends: 10 [2020-07-28 18:16:58,318 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:16:58,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2020-07-28 18:16:58,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2020-07-28 18:16:58,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:58,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand 10 states. [2020-07-28 18:16:58,325 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 18:16:58,325 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 18:16:58,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:58,327 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 18:16:58,327 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:16:58,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:58,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:58,328 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand 10 states. [2020-07-28 18:16:58,328 INFO L87 Difference]: Start difference. First operand 10 states. Second operand 10 states. [2020-07-28 18:16:58,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:58,330 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2020-07-28 18:16:58,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:16:58,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:58,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:58,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:58,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:58,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-28 18:16:58,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2020-07-28 18:16:58,334 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2020-07-28 18:16:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:58,334 INFO L479 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2020-07-28 18:16:58,335 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-28 18:16:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2020-07-28 18:16:58,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-07-28 18:16:58,336 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:58,336 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:58,550 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-28 18:16:58,551 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:58,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:58,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1270519115, now seen corresponding path program 2 times [2020-07-28 18:16:58,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:58,553 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37503279] [2020-07-28 18:16:58,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:58,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:58,701 INFO L280 TraceCheckUtils]: 0: Hoare triple {154#true} ~__return_main~0 := 0;~__return_144~0 := 0; {154#true} is VALID [2020-07-28 18:16:58,703 INFO L280 TraceCheckUtils]: 1: Hoare triple {154#true} havoc main_#res;havoc main_#t~nondet0, main_~main____CPAchecker_TMP_0~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0;havoc main_~main__x~0;havoc main_~main__y~0;main_~main__x~0 := -50;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__y~0 := main_#t~nondet0;havoc main_#t~nondet0; {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:58,705 INFO L280 TraceCheckUtils]: 2: Hoare triple {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(-1000 < main_~main__y~0); {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:58,707 INFO L280 TraceCheckUtils]: 3: Hoare triple {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(main_~main__y~0 < 1000000); {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:58,709 INFO L280 TraceCheckUtils]: 4: Hoare triple {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {157#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} is VALID [2020-07-28 18:16:58,712 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {158#(<= (+ ULTIMATE.start_main_~main__x~0 53) (* 2 ULTIMATE.start_main_~main__y~0))} is VALID [2020-07-28 18:16:58,713 INFO L280 TraceCheckUtils]: 6: Hoare triple {158#(<= (+ ULTIMATE.start_main_~main__x~0 53) (* 2 ULTIMATE.start_main_~main__y~0))} assume !(main_~main__x~0 < 0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if main_~main__y~0 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {159#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-28 18:16:58,714 INFO L280 TraceCheckUtils]: 7: Hoare triple {159#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} assume 0 == main_~__VERIFIER_assert__cond~0; {155#false} is VALID [2020-07-28 18:16:58,714 INFO L280 TraceCheckUtils]: 8: Hoare triple {155#false} assume !false; {155#false} is VALID [2020-07-28 18:16:58,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:58,715 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37503279] [2020-07-28 18:16:58,716 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [363993304] [2020-07-28 18:16:58,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:16:58,750 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-28 18:16:58,750 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:16:58,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 9 conjunts are in the unsatisfiable core [2020-07-28 18:16:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:58,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:59,104 INFO L280 TraceCheckUtils]: 0: Hoare triple {154#true} ~__return_main~0 := 0;~__return_144~0 := 0; {154#true} is VALID [2020-07-28 18:16:59,105 INFO L280 TraceCheckUtils]: 1: Hoare triple {154#true} havoc main_#res;havoc main_#t~nondet0, main_~main____CPAchecker_TMP_0~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0;havoc main_~main__x~0;havoc main_~main__y~0;main_~main__x~0 := -50;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__y~0 := main_#t~nondet0;havoc main_#t~nondet0; {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:59,106 INFO L280 TraceCheckUtils]: 2: Hoare triple {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(-1000 < main_~main__y~0); {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:59,107 INFO L280 TraceCheckUtils]: 3: Hoare triple {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(main_~main__y~0 < 1000000); {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:59,109 INFO L280 TraceCheckUtils]: 4: Hoare triple {156#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {157#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} is VALID [2020-07-28 18:16:59,110 INFO L280 TraceCheckUtils]: 5: Hoare triple {157#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {158#(<= (+ ULTIMATE.start_main_~main__x~0 53) (* 2 ULTIMATE.start_main_~main__y~0))} is VALID [2020-07-28 18:16:59,111 INFO L280 TraceCheckUtils]: 6: Hoare triple {158#(<= (+ ULTIMATE.start_main_~main__x~0 53) (* 2 ULTIMATE.start_main_~main__y~0))} assume !(main_~main__x~0 < 0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if main_~main__y~0 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {181#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-28 18:16:59,112 INFO L280 TraceCheckUtils]: 7: Hoare triple {181#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {155#false} is VALID [2020-07-28 18:16:59,113 INFO L280 TraceCheckUtils]: 8: Hoare triple {155#false} assume !false; {155#false} is VALID [2020-07-28 18:16:59,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:59,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:16:59,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-07-28 18:16:59,115 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439479457] [2020-07-28 18:16:59,115 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-07-28 18:16:59,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:59,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 18:16:59,133 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:59,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 18:16:59,133 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:59,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 18:16:59,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-28 18:16:59,135 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 7 states. [2020-07-28 18:16:59,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:59,255 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2020-07-28 18:16:59,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 18:16:59,255 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 9 [2020-07-28 18:16:59,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:59,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:16:59,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2020-07-28 18:16:59,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 18:16:59,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2020-07-28 18:16:59,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 14 transitions. [2020-07-28 18:16:59,277 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:59,278 INFO L225 Difference]: With dead ends: 14 [2020-07-28 18:16:59,278 INFO L226 Difference]: Without dead ends: 11 [2020-07-28 18:16:59,279 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2020-07-28 18:16:59,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2020-07-28 18:16:59,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2020-07-28 18:16:59,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:59,286 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:59,286 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:59,286 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:59,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:59,288 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:16:59,288 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:16:59,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:59,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:59,289 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:59,289 INFO L87 Difference]: Start difference. First operand 11 states. Second operand 11 states. [2020-07-28 18:16:59,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:59,291 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:16:59,291 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:16:59,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:16:59,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:16:59,292 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:16:59,292 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:16:59,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2020-07-28 18:16:59,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2020-07-28 18:16:59,294 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2020-07-28 18:16:59,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:16:59,294 INFO L479 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2020-07-28 18:16:59,294 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 18:16:59,295 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2020-07-28 18:16:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-28 18:16:59,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:16:59,296 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:16:59,507 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:16:59,508 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:16:59,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:16:59,509 INFO L82 PathProgramCache]: Analyzing trace with hash 731324427, now seen corresponding path program 3 times [2020-07-28 18:16:59,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:16:59,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271118904] [2020-07-28 18:16:59,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:16:59,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:59,613 INFO L280 TraceCheckUtils]: 0: Hoare triple {244#true} ~__return_main~0 := 0;~__return_144~0 := 0; {244#true} is VALID [2020-07-28 18:16:59,615 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#true} havoc main_#res;havoc main_#t~nondet0, main_~main____CPAchecker_TMP_0~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0;havoc main_~main__x~0;havoc main_~main__y~0;main_~main__x~0 := -50;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__y~0 := main_#t~nondet0;havoc main_#t~nondet0; {246#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:59,616 INFO L280 TraceCheckUtils]: 2: Hoare triple {246#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(-1000 < main_~main__y~0); {246#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:59,617 INFO L280 TraceCheckUtils]: 3: Hoare triple {246#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume !!(main_~main__y~0 < 1000000); {246#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} is VALID [2020-07-28 18:16:59,618 INFO L280 TraceCheckUtils]: 4: Hoare triple {246#(<= (+ ULTIMATE.start_main_~main__x~0 50) 0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {247#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} is VALID [2020-07-28 18:16:59,620 INFO L280 TraceCheckUtils]: 5: Hoare triple {247#(<= (+ ULTIMATE.start_main_~main__x~0 51) ULTIMATE.start_main_~main__y~0)} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {248#(<= (+ ULTIMATE.start_main_~main__x~0 53) (* 2 ULTIMATE.start_main_~main__y~0))} is VALID [2020-07-28 18:16:59,622 INFO L280 TraceCheckUtils]: 6: Hoare triple {248#(<= (+ ULTIMATE.start_main_~main__x~0 53) (* 2 ULTIMATE.start_main_~main__y~0))} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {249#(<= (+ ULTIMATE.start_main_~main__x~0 56) (* 3 ULTIMATE.start_main_~main__y~0))} is VALID [2020-07-28 18:16:59,623 INFO L280 TraceCheckUtils]: 7: Hoare triple {249#(<= (+ ULTIMATE.start_main_~main__x~0 56) (* 3 ULTIMATE.start_main_~main__y~0))} assume !(main_~main__x~0 < 0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if main_~main__y~0 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {250#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} is VALID [2020-07-28 18:16:59,624 INFO L280 TraceCheckUtils]: 8: Hoare triple {250#(not (= 0 ULTIMATE.start_main_~__VERIFIER_assert__cond~0))} assume 0 == main_~__VERIFIER_assert__cond~0; {245#false} is VALID [2020-07-28 18:16:59,625 INFO L280 TraceCheckUtils]: 9: Hoare triple {245#false} assume !false; {245#false} is VALID [2020-07-28 18:16:59,626 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:16:59,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271118904] [2020-07-28 18:16:59,626 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927235695] [2020-07-28 18:16:59,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2020-07-28 18:16:59,650 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-28 18:16:59,651 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-28 18:16:59,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:16:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:16:59,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:16:59,908 INFO L280 TraceCheckUtils]: 0: Hoare triple {244#true} ~__return_main~0 := 0;~__return_144~0 := 0; {244#true} is VALID [2020-07-28 18:16:59,908 INFO L280 TraceCheckUtils]: 1: Hoare triple {244#true} havoc main_#res;havoc main_#t~nondet0, main_~main____CPAchecker_TMP_0~0, main_~__tmp_1~0, main_~__VERIFIER_assert__cond~0, main_~main__x~0, main_~main__y~0;havoc main_~main__x~0;havoc main_~main__y~0;main_~main__x~0 := -50;assume -2147483648 <= main_#t~nondet0 && main_#t~nondet0 <= 2147483647;main_~main__y~0 := main_#t~nondet0;havoc main_#t~nondet0; {244#true} is VALID [2020-07-28 18:16:59,909 INFO L280 TraceCheckUtils]: 2: Hoare triple {244#true} assume !!(-1000 < main_~main__y~0); {244#true} is VALID [2020-07-28 18:16:59,909 INFO L280 TraceCheckUtils]: 3: Hoare triple {244#true} assume !!(main_~main__y~0 < 1000000); {244#true} is VALID [2020-07-28 18:16:59,909 INFO L280 TraceCheckUtils]: 4: Hoare triple {244#true} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {244#true} is VALID [2020-07-28 18:16:59,909 INFO L280 TraceCheckUtils]: 5: Hoare triple {244#true} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {244#true} is VALID [2020-07-28 18:16:59,911 INFO L280 TraceCheckUtils]: 6: Hoare triple {244#true} assume main_~main__x~0 < 0;main_~main__x~0 := main_~main__x~0 + main_~main__y~0;main_~main____CPAchecker_TMP_0~0 := main_~main__y~0;main_~main__y~0 := 1 + main_~main__y~0; {272#(<= (+ ULTIMATE.start_main_~main__x~0 2) ULTIMATE.start_main_~main__y~0)} is VALID [2020-07-28 18:16:59,912 INFO L280 TraceCheckUtils]: 7: Hoare triple {272#(<= (+ ULTIMATE.start_main_~main__x~0 2) ULTIMATE.start_main_~main__y~0)} assume !(main_~main__x~0 < 0);havoc main_~__tmp_1~0;main_~__tmp_1~0 := (if main_~main__y~0 > 0 then 1 else 0);havoc main_~__VERIFIER_assert__cond~0;main_~__VERIFIER_assert__cond~0 := main_~__tmp_1~0; {276#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} is VALID [2020-07-28 18:16:59,913 INFO L280 TraceCheckUtils]: 8: Hoare triple {276#(<= 1 ULTIMATE.start_main_~__VERIFIER_assert__cond~0)} assume 0 == main_~__VERIFIER_assert__cond~0; {245#false} is VALID [2020-07-28 18:16:59,914 INFO L280 TraceCheckUtils]: 9: Hoare triple {245#false} assume !false; {245#false} is VALID [2020-07-28 18:16:59,914 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-28 18:16:59,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-07-28 18:16:59,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2020-07-28 18:16:59,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65800020] [2020-07-28 18:16:59,916 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 18:16:59,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:16:59,916 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:16:59,929 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:59,929 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:16:59,930 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:16:59,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:16:59,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-07-28 18:16:59,931 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 4 states. [2020-07-28 18:16:59,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:59,975 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2020-07-28 18:16:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:16:59,975 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 10 [2020-07-28 18:16:59,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:16:59,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:16:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-28 18:16:59,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:16:59,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 9 transitions. [2020-07-28 18:16:59,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 9 transitions. [2020-07-28 18:16:59,996 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:16:59,996 INFO L225 Difference]: With dead ends: 11 [2020-07-28 18:16:59,996 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:16:59,997 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-07-28 18:16:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:16:59,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:16:59,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:16:59,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:59,998 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:59,999 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:16:59,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:16:59,999 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:16:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:16:59,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:00,000 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:00,000 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:00,000 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:17:00,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:17:00,001 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:17:00,001 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:00,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:00,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:17:00,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:17:00,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:17:00,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:17:00,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:17:00,004 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 10 [2020-07-28 18:17:00,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:17:00,005 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:17:00,005 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:17:00,005 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:17:00,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:17:00,214 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:17:00,218 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:17:00,243 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:17:00,243 INFO L268 CegarLoopResult]: For program point L23(lines 23 56) no Hoare annotation was computed. [2020-07-28 18:17:00,243 INFO L271 CegarLoopResult]: At program point L52(lines 11 58) the Hoare annotation is: true [2020-07-28 18:17:00,243 INFO L268 CegarLoopResult]: For program point L17(lines 17 57) no Hoare annotation was computed. [2020-07-28 18:17:00,243 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed. [2020-07-28 18:17:00,244 INFO L268 CegarLoopResult]: For program point L44(lines 44 53) no Hoare annotation was computed. [2020-07-28 18:17:00,244 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:17:00,244 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:17:00,244 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:17:00,244 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed. [2020-07-28 18:17:00,244 INFO L264 CegarLoopResult]: At program point L35(lines 28 56) the Hoare annotation is: (or (<= (+ ULTIMATE.start_main_~main__x~0 50) 0) (<= (+ ULTIMATE.start_main_~main__x~0 2) ULTIMATE.start_main_~main__y~0)) [2020-07-28 18:17:00,248 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:17:00,248 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:17:00,248 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 18:17:00,248 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2020-07-28 18:17:00,248 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:00,249 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:17:00,249 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation [2020-07-28 18:17:00,249 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:17:00,251 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 18:17:00,251 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 18:17:00,251 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation [2020-07-28 18:17:00,251 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 18:17:00,251 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation [2020-07-28 18:17:00,252 INFO L163 areAnnotationChecker]: CFG has 1 edges. 1 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:17:00,263 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:17:00 BoogieIcfgContainer [2020-07-28 18:17:00,263 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:17:00,263 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:17:00,264 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:17:00,264 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:17:00,264 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:16:57" (3/4) ... [2020-07-28 18:17:00,270 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:17:00,282 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2020-07-28 18:17:00,282 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2020-07-28 18:17:00,331 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:17:00,331 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:17:00,334 INFO L168 Benchmark]: Toolchain (without parser) took 4045.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 960.2 MB in the beginning and 798.0 MB in the end (delta: 162.3 MB). Peak memory consumption was 263.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:00,335 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:17:00,336 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:00,337 INFO L168 Benchmark]: Boogie Procedure Inliner took 91.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:00,337 INFO L168 Benchmark]: Boogie Preprocessor took 16.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 18:17:00,338 INFO L168 Benchmark]: RCFGBuilder took 288.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:00,339 INFO L168 Benchmark]: TraceAbstraction took 3253.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 804.6 MB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:00,339 INFO L168 Benchmark]: Witness Printer took 67.79 ms. Allocated memory is still 1.1 GB. Free memory was 804.6 MB in the beginning and 798.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:17:00,343 INFO L336 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.21 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.90 ms. Allocated memory is still 1.0 GB. Free memory was 960.2 MB in the beginning and 949.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 91.06 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 101.2 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -148.2 MB). Peak memory consumption was 9.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.32 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 288.58 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3253.37 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 804.6 MB in the end (delta: 266.2 MB). Peak memory consumption was 266.2 MB. Max. memory is 11.5 GB. * Witness Printer took 67.79 ms. Allocated memory is still 1.1 GB. Free memory was 804.6 MB in the beginning and 798.0 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 46]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: main__x + 50 <= 0 || main__x + 2 <= main__y - InvariantResult [Line: 11]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.1s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 29 SDtfs, 7 SDslu, 42 SDs, 0 SdLazy, 63 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11occurred in iteration=0, 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, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 7 NumberOfFragments, 12 HoareAnnotationTreeSize, 2 FomulaSimplifications, 24 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 61 NumberOfCodeBlocks, 60 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 1480 SizeOfPredicates, 12 NumberOfNonLiveVariables, 101 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...