/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-267fbe0
[2020-07-17 22:51:50,987 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-17 22:51:50,990 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-17 22:51:51,003 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-17 22:51:51,003 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-17 22:51:51,004 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-17 22:51:51,006 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-17 22:51:51,008 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-17 22:51:51,010 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-17 22:51:51,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-17 22:51:51,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-17 22:51:51,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-17 22:51:51,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-17 22:51:51,015 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-17 22:51:51,016 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-17 22:51:51,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-17 22:51:51,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-17 22:51:51,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-17 22:51:51,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-17 22:51:51,022 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-17 22:51:51,024 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-17 22:51:51,025 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-17 22:51:51,026 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-17 22:51:51,026 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-17 22:51:51,029 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-17 22:51:51,029 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-17 22:51:51,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-17 22:51:51,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-17 22:51:51,031 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-17 22:51:51,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-17 22:51:51,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-17 22:51:51,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-17 22:51:51,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-17 22:51:51,034 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-17 22:51:51,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-17 22:51:51,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-17 22:51:51,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-17 22:51:51,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-17 22:51:51,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-17 22:51:51,038 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-17 22:51:51,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-17 22:51:51,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2020-07-17 22:51:51,053 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-17 22:51:51,053 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-17 22:51:51,055 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-17 22:51:51,055 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-07-17 22:51:51,055 INFO L138 SettingsManager]: * Use SBE=true
[2020-07-17 22:51:51,055 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-17 22:51:51,055 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-17 22:51:51,056 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-17 22:51:51,056 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-17 22:51:51,056 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-17 22:51:51,056 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-17 22:51:51,057 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-17 22:51:51,057 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-17 22:51:51,057 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-17 22:51:51,057 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-17 22:51:51,057 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-17 22:51:51,058 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-17 22:51:51,058 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-17 22:51:51,058 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-07-17 22:51:51,058 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-17 22:51:51,058 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-17 22:51:51,059 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-17 22:51:51,059 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-17 22:51:51,059 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-07-17 22:51:51,059 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-17 22:51:51,059 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-07-17 22:51:51,060 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-17 22:51:51,060 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-17 22:51:51,060 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-07-17 22:51:51,060 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-07-17 22:51:51,371 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-17 22:51:51,391 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-17 22:51:51,395 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-17 22:51:51,397 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-17 22:51:51,397 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-17 22:51:51,398 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/cggmp2005b.i
[2020-07-17 22:51:51,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86242831c/d062c5e7289e454cb712ba8fb0c0a281/FLAGe7e20d81d
[2020-07-17 22:51:51,920 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-17 22:51:51,921 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/cggmp2005b.i
[2020-07-17 22:51:51,928 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86242831c/d062c5e7289e454cb712ba8fb0c0a281/FLAGe7e20d81d
[2020-07-17 22:51:52,284 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86242831c/d062c5e7289e454cb712ba8fb0c0a281
[2020-07-17 22:51:52,293 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-17 22:51:52,297 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-17 22:51:52,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-17 22:51:52,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-17 22:51:52,302 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-17 22:51:52,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,307 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3aac5b92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52, skipping insertion in model container
[2020-07-17 22:51:52,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-17 22:51:52,338 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-17 22:51:52,553 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-17 22:51:52,562 INFO L203 MainTranslator]: Completed pre-run
[2020-07-17 22:51:52,581 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-17 22:51:52,595 INFO L208 MainTranslator]: Completed translation
[2020-07-17 22:51:52,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52 WrapperNode
[2020-07-17 22:51:52,596 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-17 22:51:52,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-17 22:51:52,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-17 22:51:52,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-17 22:51:52,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,618 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,626 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (1/1) ...
[2020-07-17 22:51:52,710 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-17 22:51:52,713 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-17 22:51:52,713 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-17 22:51:52,713 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-17 22:51:52,715 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (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-17 22:51:52,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-17 22:51:52,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-17 22:51:52,779 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-17 22:51:52,779 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert
[2020-07-17 22:51:52,779 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-17 22:51:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-17 22:51:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-07-17 22:51:52,779 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-17 22:51:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-17 22:51:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-17 22:51:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-17 22:51:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-17 22:51:52,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-17 22:51:53,027 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-17 22:51:53,027 INFO L295 CfgBuilder]: Removed 3 assume(true) statements.
[2020-07-17 22:51:53,035 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:53 BoogieIcfgContainer
[2020-07-17 22:51:53,035 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-17 22:51:53,037 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-17 22:51:53,038 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-17 22:51:53,043 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-17 22:51:53,043 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:51:52" (1/3) ...
[2020-07-17 22:51:53,045 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9fb270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:53, skipping insertion in model container
[2020-07-17 22:51:53,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:51:52" (2/3) ...
[2020-07-17 22:51:53,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d9fb270 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:51:53, skipping insertion in model container
[2020-07-17 22:51:53,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:51:53" (3/3) ...
[2020-07-17 22:51:53,049 INFO L109 eAbstractionObserver]: Analyzing ICFG cggmp2005b.i
[2020-07-17 22:51:53,063 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-07-17 22:51:53,071 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-17 22:51:53,093 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-17 22:51:53,121 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-17 22:51:53,121 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-17 22:51:53,121 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-07-17 22:51:53,122 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-17 22:51:53,122 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-17 22:51:53,122 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-17 22:51:53,122 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-17 22:51:53,122 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-17 22:51:53,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states.
[2020-07-17 22:51:53,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-07-17 22:51:53,150 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-17 22:51:53,151 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-17 22:51:53,152 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-17 22:51:53,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-17 22:51:53,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1039733575, now seen corresponding path program 1 times
[2020-07-17 22:51:53,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-17 22:51:53,171 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210257547]
[2020-07-17 22:51:53,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-17 22:51:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:53,303 INFO L280 TraceCheckUtils]: 0: Hoare triple {24#true} assume true; {24#true} is VALID
[2020-07-17 22:51:53,304 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {24#true} {24#true} #65#return; {24#true} is VALID
[2020-07-17 22:51:53,306 INFO L263 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {24#true} is VALID
[2020-07-17 22:51:53,307 INFO L280 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID
[2020-07-17 22:51:53,307 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #65#return; {24#true} is VALID
[2020-07-17 22:51:53,307 INFO L263 TraceCheckUtils]: 3: Hoare triple {24#true} call #t~ret0 := main(); {24#true} is VALID
[2020-07-17 22:51:53,308 INFO L280 TraceCheckUtils]: 4: Hoare triple {24#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {24#true} is VALID
[2020-07-17 22:51:53,309 INFO L280 TraceCheckUtils]: 5: Hoare triple {24#true} assume !true; {25#false} is VALID
[2020-07-17 22:51:53,310 INFO L263 TraceCheckUtils]: 6: Hoare triple {25#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {25#false} is VALID
[2020-07-17 22:51:53,310 INFO L280 TraceCheckUtils]: 7: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID
[2020-07-17 22:51:53,311 INFO L280 TraceCheckUtils]: 8: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID
[2020-07-17 22:51:53,311 INFO L280 TraceCheckUtils]: 9: Hoare triple {25#false} assume !false; {25#false} is VALID
[2020-07-17 22:51:53,312 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-17 22:51:53,313 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210257547]
[2020-07-17 22:51:53,314 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-17 22:51:53,314 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2020-07-17 22:51:53,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515665350]
[2020-07-17 22:51:53,338 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10
[2020-07-17 22:51:53,341 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-17 22:51:53,345 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states.
[2020-07-17 22:51:53,369 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-17 22:51:53,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states
[2020-07-17 22:51:53,370 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-17 22:51:53,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2020-07-17 22:51:53,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2020-07-17 22:51:53,383 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 2 states.
[2020-07-17 22:51:53,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:53,453 INFO L93 Difference]: Finished difference Result 37 states and 50 transitions.
[2020-07-17 22:51:53,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2020-07-17 22:51:53,454 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10
[2020-07-17 22:51:53,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-17 22:51:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2020-07-17 22:51:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions.
[2020-07-17 22:51:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states.
[2020-07-17 22:51:53,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 50 transitions.
[2020-07-17 22:51:53,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 50 transitions.
[2020-07-17 22:51:53,569 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:53,581 INFO L225 Difference]: With dead ends: 37
[2020-07-17 22:51:53,581 INFO L226 Difference]: Without dead ends: 14
[2020-07-17 22:51:53,586 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2020-07-17 22:51:53,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2020-07-17 22:51:53,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2020-07-17 22:51:53,630 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-17 22:51:53,631 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states.
[2020-07-17 22:51:53,631 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2020-07-17 22:51:53,632 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2020-07-17 22:51:53,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:53,635 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions.
[2020-07-17 22:51:53,636 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions.
[2020-07-17 22:51:53,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:53,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:53,637 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2020-07-17 22:51:53,637 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2020-07-17 22:51:53,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:53,640 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions.
[2020-07-17 22:51:53,641 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions.
[2020-07-17 22:51:53,641 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:53,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:53,642 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-17 22:51:53,642 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-17 22:51:53,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-07-17 22:51:53,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 16 transitions.
[2020-07-17 22:51:53,647 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 16 transitions. Word has length 10
[2020-07-17 22:51:53,647 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-17 22:51:53,647 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 16 transitions.
[2020-07-17 22:51:53,647 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2020-07-17 22:51:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 16 transitions.
[2020-07-17 22:51:53,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2020-07-17 22:51:53,648 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-17 22:51:53,649 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-17 22:51:53,649 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-17 22:51:53,649 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-17 22:51:53,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-17 22:51:53,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1066515684, now seen corresponding path program 1 times
[2020-07-17 22:51:53,651 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-17 22:51:53,651 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523854889]
[2020-07-17 22:51:53,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-17 22:51:53,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:53,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:53,710 INFO L280 TraceCheckUtils]: 0: Hoare triple {132#true} assume true; {132#true} is VALID
[2020-07-17 22:51:53,710 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {132#true} {132#true} #65#return; {132#true} is VALID
[2020-07-17 22:51:53,711 INFO L263 TraceCheckUtils]: 0: Hoare triple {132#true} call ULTIMATE.init(); {132#true} is VALID
[2020-07-17 22:51:53,711 INFO L280 TraceCheckUtils]: 1: Hoare triple {132#true} assume true; {132#true} is VALID
[2020-07-17 22:51:53,712 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {132#true} {132#true} #65#return; {132#true} is VALID
[2020-07-17 22:51:53,712 INFO L263 TraceCheckUtils]: 3: Hoare triple {132#true} call #t~ret0 := main(); {132#true} is VALID
[2020-07-17 22:51:53,713 INFO L280 TraceCheckUtils]: 4: Hoare triple {132#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {136#(<= main_~i~0 0)} is VALID
[2020-07-17 22:51:53,715 INFO L280 TraceCheckUtils]: 5: Hoare triple {136#(<= main_~i~0 0)} assume !(~i~0 <= 100); {133#false} is VALID
[2020-07-17 22:51:53,715 INFO L263 TraceCheckUtils]: 6: Hoare triple {133#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {133#false} is VALID
[2020-07-17 22:51:53,715 INFO L280 TraceCheckUtils]: 7: Hoare triple {133#false} ~cond := #in~cond; {133#false} is VALID
[2020-07-17 22:51:53,716 INFO L280 TraceCheckUtils]: 8: Hoare triple {133#false} assume 0 == ~cond; {133#false} is VALID
[2020-07-17 22:51:53,716 INFO L280 TraceCheckUtils]: 9: Hoare triple {133#false} assume !false; {133#false} is VALID
[2020-07-17 22:51:53,717 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-17 22:51:53,718 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523854889]
[2020-07-17 22:51:53,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-17 22:51:53,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-07-17 22:51:53,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295300640]
[2020-07-17 22:51:53,720 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-07-17 22:51:53,721 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-17 22:51:53,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-17 22:51:53,735 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-17 22:51:53,736 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-07-17 22:51:53,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-17 22:51:53,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-07-17 22:51:53,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-17 22:51:53,737 INFO L87 Difference]: Start difference. First operand 14 states and 16 transitions. Second operand 3 states.
[2020-07-17 22:51:53,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:53,781 INFO L93 Difference]: Finished difference Result 20 states and 22 transitions.
[2020-07-17 22:51:53,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-07-17 22:51:53,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2020-07-17 22:51:53,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-17 22:51:53,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-17 22:51:53,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions.
[2020-07-17 22:51:53,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-17 22:51:53,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 22 transitions.
[2020-07-17 22:51:53,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 22 transitions.
[2020-07-17 22:51:53,818 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:53,819 INFO L225 Difference]: With dead ends: 20
[2020-07-17 22:51:53,820 INFO L226 Difference]: Without dead ends: 15
[2020-07-17 22:51:53,821 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 22:51:53,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2020-07-17 22:51:53,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2020-07-17 22:51:53,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-17 22:51:53,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states.
[2020-07-17 22:51:53,832 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states.
[2020-07-17 22:51:53,832 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states.
[2020-07-17 22:51:53,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:53,835 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions.
[2020-07-17 22:51:53,835 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions.
[2020-07-17 22:51:53,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:53,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:53,836 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states.
[2020-07-17 22:51:53,837 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states.
[2020-07-17 22:51:53,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:53,839 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions.
[2020-07-17 22:51:53,839 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions.
[2020-07-17 22:51:53,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:53,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:53,840 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-17 22:51:53,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-17 22:51:53,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-07-17 22:51:53,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions.
[2020-07-17 22:51:53,843 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 10
[2020-07-17 22:51:53,843 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-17 22:51:53,843 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions.
[2020-07-17 22:51:53,843 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-07-17 22:51:53,844 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions.
[2020-07-17 22:51:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-07-17 22:51:53,845 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-17 22:51:53,845 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-17 22:51:53,845 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2020-07-17 22:51:53,845 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-17 22:51:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-17 22:51:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1875131310, now seen corresponding path program 1 times
[2020-07-17 22:51:53,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-17 22:51:53,847 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139924402]
[2020-07-17 22:51:53,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-17 22:51:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:53,894 INFO L280 TraceCheckUtils]: 0: Hoare triple {226#true} assume true; {226#true} is VALID
[2020-07-17 22:51:53,895 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {226#true} {226#true} #65#return; {226#true} is VALID
[2020-07-17 22:51:53,895 INFO L263 TraceCheckUtils]: 0: Hoare triple {226#true} call ULTIMATE.init(); {226#true} is VALID
[2020-07-17 22:51:53,895 INFO L280 TraceCheckUtils]: 1: Hoare triple {226#true} assume true; {226#true} is VALID
[2020-07-17 22:51:53,896 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {226#true} {226#true} #65#return; {226#true} is VALID
[2020-07-17 22:51:53,896 INFO L263 TraceCheckUtils]: 3: Hoare triple {226#true} call #t~ret0 := main(); {226#true} is VALID
[2020-07-17 22:51:53,897 INFO L280 TraceCheckUtils]: 4: Hoare triple {226#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {230#(<= (+ main_~j~0 100) 0)} is VALID
[2020-07-17 22:51:53,898 INFO L280 TraceCheckUtils]: 5: Hoare triple {230#(<= (+ main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {230#(<= (+ main_~j~0 100) 0)} is VALID
[2020-07-17 22:51:53,900 INFO L280 TraceCheckUtils]: 6: Hoare triple {230#(<= (+ main_~j~0 100) 0)} assume !(~j~0 < 20); {227#false} is VALID
[2020-07-17 22:51:53,900 INFO L280 TraceCheckUtils]: 7: Hoare triple {227#false} ~k~0 := 4; {227#false} is VALID
[2020-07-17 22:51:53,901 INFO L280 TraceCheckUtils]: 8: Hoare triple {227#false} assume !(~k~0 <= 3); {227#false} is VALID
[2020-07-17 22:51:53,901 INFO L280 TraceCheckUtils]: 9: Hoare triple {227#false} assume !(~i~0 <= 100); {227#false} is VALID
[2020-07-17 22:51:53,901 INFO L263 TraceCheckUtils]: 10: Hoare triple {227#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {227#false} is VALID
[2020-07-17 22:51:53,902 INFO L280 TraceCheckUtils]: 11: Hoare triple {227#false} ~cond := #in~cond; {227#false} is VALID
[2020-07-17 22:51:53,902 INFO L280 TraceCheckUtils]: 12: Hoare triple {227#false} assume 0 == ~cond; {227#false} is VALID
[2020-07-17 22:51:53,902 INFO L280 TraceCheckUtils]: 13: Hoare triple {227#false} assume !false; {227#false} is VALID
[2020-07-17 22:51:53,904 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-17 22:51:53,904 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139924402]
[2020-07-17 22:51:53,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-17 22:51:53,905 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2020-07-17 22:51:53,905 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42571287]
[2020-07-17 22:51:53,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-07-17 22:51:53,906 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-17 22:51:53,907 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states.
[2020-07-17 22:51:53,927 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-17 22:51:53,927 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states
[2020-07-17 22:51:53,928 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-17 22:51:53,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2020-07-17 22:51:53,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2020-07-17 22:51:53,929 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand 3 states.
[2020-07-17 22:51:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:53,976 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions.
[2020-07-17 22:51:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2020-07-17 22:51:53,976 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14
[2020-07-17 22:51:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-17 22:51:53,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-17 22:51:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions.
[2020-07-17 22:51:53,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states.
[2020-07-17 22:51:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 30 transitions.
[2020-07-17 22:51:53,981 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 30 transitions.
[2020-07-17 22:51:54,036 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:54,037 INFO L225 Difference]: With dead ends: 25
[2020-07-17 22:51:54,038 INFO L226 Difference]: Without dead ends: 16
[2020-07-17 22:51:54,038 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-17 22:51:54,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states.
[2020-07-17 22:51:54,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16.
[2020-07-17 22:51:54,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-17 22:51:54,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand 16 states.
[2020-07-17 22:51:54,050 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states.
[2020-07-17 22:51:54,050 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states.
[2020-07-17 22:51:54,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:54,052 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions.
[2020-07-17 22:51:54,052 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions.
[2020-07-17 22:51:54,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:54,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:54,053 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand 16 states.
[2020-07-17 22:51:54,054 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 16 states.
[2020-07-17 22:51:54,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:54,055 INFO L93 Difference]: Finished difference Result 16 states and 18 transitions.
[2020-07-17 22:51:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions.
[2020-07-17 22:51:54,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:54,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:54,056 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-17 22:51:54,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-17 22:51:54,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states.
[2020-07-17 22:51:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions.
[2020-07-17 22:51:54,058 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 14
[2020-07-17 22:51:54,059 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-17 22:51:54,059 INFO L479 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions.
[2020-07-17 22:51:54,059 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2020-07-17 22:51:54,059 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions.
[2020-07-17 22:51:54,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16
[2020-07-17 22:51:54,060 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-17 22:51:54,060 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-17 22:51:54,060 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2020-07-17 22:51:54,061 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-17 22:51:54,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-17 22:51:54,061 INFO L82 PathProgramCache]: Analyzing trace with hash -224898986, now seen corresponding path program 1 times
[2020-07-17 22:51:54,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-17 22:51:54,062 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879729717]
[2020-07-17 22:51:54,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-17 22:51:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,143 INFO L280 TraceCheckUtils]: 0: Hoare triple {333#true} assume true; {333#true} is VALID
[2020-07-17 22:51:54,144 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {333#true} {333#true} #65#return; {333#true} is VALID
[2020-07-17 22:51:54,144 INFO L263 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID
[2020-07-17 22:51:54,144 INFO L280 TraceCheckUtils]: 1: Hoare triple {333#true} assume true; {333#true} is VALID
[2020-07-17 22:51:54,145 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {333#true} {333#true} #65#return; {333#true} is VALID
[2020-07-17 22:51:54,145 INFO L263 TraceCheckUtils]: 3: Hoare triple {333#true} call #t~ret0 := main(); {333#true} is VALID
[2020-07-17 22:51:54,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {333#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {337#(<= (+ main_~i~0 main_~j~0 100) 0)} is VALID
[2020-07-17 22:51:54,148 INFO L280 TraceCheckUtils]: 5: Hoare triple {337#(<= (+ main_~i~0 main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {338#(<= (+ main_~i~0 main_~j~0 99) 0)} is VALID
[2020-07-17 22:51:54,149 INFO L280 TraceCheckUtils]: 6: Hoare triple {338#(<= (+ main_~i~0 main_~j~0 99) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {339#(<= (+ main_~j~0 99) 0)} is VALID
[2020-07-17 22:51:54,150 INFO L280 TraceCheckUtils]: 7: Hoare triple {339#(<= (+ main_~j~0 99) 0)} assume !(~j~0 < 20); {334#false} is VALID
[2020-07-17 22:51:54,151 INFO L280 TraceCheckUtils]: 8: Hoare triple {334#false} ~k~0 := 4; {334#false} is VALID
[2020-07-17 22:51:54,151 INFO L280 TraceCheckUtils]: 9: Hoare triple {334#false} assume !(~k~0 <= 3); {334#false} is VALID
[2020-07-17 22:51:54,151 INFO L280 TraceCheckUtils]: 10: Hoare triple {334#false} assume !(~i~0 <= 100); {334#false} is VALID
[2020-07-17 22:51:54,152 INFO L263 TraceCheckUtils]: 11: Hoare triple {334#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {334#false} is VALID
[2020-07-17 22:51:54,152 INFO L280 TraceCheckUtils]: 12: Hoare triple {334#false} ~cond := #in~cond; {334#false} is VALID
[2020-07-17 22:51:54,152 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#false} assume 0 == ~cond; {334#false} is VALID
[2020-07-17 22:51:54,153 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#false} assume !false; {334#false} is VALID
[2020-07-17 22:51:54,154 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-17 22:51:54,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879729717]
[2020-07-17 22:51:54,154 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040302894]
[2020-07-17 22:51:54,154 INFO L94 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-17 22:51:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,185 INFO L264 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 3 conjunts are in the unsatisfiable core
[2020-07-17 22:51:54,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,197 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-17 22:51:54,345 INFO L263 TraceCheckUtils]: 0: Hoare triple {333#true} call ULTIMATE.init(); {333#true} is VALID
[2020-07-17 22:51:54,345 INFO L280 TraceCheckUtils]: 1: Hoare triple {333#true} assume true; {333#true} is VALID
[2020-07-17 22:51:54,346 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {333#true} {333#true} #65#return; {333#true} is VALID
[2020-07-17 22:51:54,346 INFO L263 TraceCheckUtils]: 3: Hoare triple {333#true} call #t~ret0 := main(); {333#true} is VALID
[2020-07-17 22:51:54,347 INFO L280 TraceCheckUtils]: 4: Hoare triple {333#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {355#(<= main_~i~0 0)} is VALID
[2020-07-17 22:51:54,348 INFO L280 TraceCheckUtils]: 5: Hoare triple {355#(<= main_~i~0 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {359#(<= main_~i~0 1)} is VALID
[2020-07-17 22:51:54,349 INFO L280 TraceCheckUtils]: 6: Hoare triple {359#(<= main_~i~0 1)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {359#(<= main_~i~0 1)} is VALID
[2020-07-17 22:51:54,350 INFO L280 TraceCheckUtils]: 7: Hoare triple {359#(<= main_~i~0 1)} assume !(~j~0 < 20); {359#(<= main_~i~0 1)} is VALID
[2020-07-17 22:51:54,351 INFO L280 TraceCheckUtils]: 8: Hoare triple {359#(<= main_~i~0 1)} ~k~0 := 4; {359#(<= main_~i~0 1)} is VALID
[2020-07-17 22:51:54,352 INFO L280 TraceCheckUtils]: 9: Hoare triple {359#(<= main_~i~0 1)} assume !(~k~0 <= 3); {359#(<= main_~i~0 1)} is VALID
[2020-07-17 22:51:54,353 INFO L280 TraceCheckUtils]: 10: Hoare triple {359#(<= main_~i~0 1)} assume !(~i~0 <= 100); {334#false} is VALID
[2020-07-17 22:51:54,353 INFO L263 TraceCheckUtils]: 11: Hoare triple {334#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {334#false} is VALID
[2020-07-17 22:51:54,354 INFO L280 TraceCheckUtils]: 12: Hoare triple {334#false} ~cond := #in~cond; {334#false} is VALID
[2020-07-17 22:51:54,354 INFO L280 TraceCheckUtils]: 13: Hoare triple {334#false} assume 0 == ~cond; {334#false} is VALID
[2020-07-17 22:51:54,354 INFO L280 TraceCheckUtils]: 14: Hoare triple {334#false} assume !false; {334#false} is VALID
[2020-07-17 22:51:54,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2020-07-17 22:51:54,356 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-17 22:51:54,356 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7
[2020-07-17 22:51:54,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761098076]
[2020-07-17 22:51:54,357 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-07-17 22:51:54,357 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-17 22:51:54,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-17 22:51:54,387 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:54,387 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-17 22:51:54,388 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-17 22:51:54,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-17 22:51:54,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2020-07-17 22:51:54,388 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand 7 states.
[2020-07-17 22:51:54,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:54,570 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions.
[2020-07-17 22:51:54,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-07-17 22:51:54,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15
[2020-07-17 22:51:54,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-17 22:51:54,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-17 22:51:54,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions.
[2020-07-17 22:51:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-17 22:51:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 38 transitions.
[2020-07-17 22:51:54,576 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 38 transitions.
[2020-07-17 22:51:54,621 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:54,622 INFO L225 Difference]: With dead ends: 30
[2020-07-17 22:51:54,623 INFO L226 Difference]: Without dead ends: 21
[2020-07-17 22:51:54,623 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90
[2020-07-17 22:51:54,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states.
[2020-07-17 22:51:54,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21.
[2020-07-17 22:51:54,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-17 22:51:54,640 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand 21 states.
[2020-07-17 22:51:54,641 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states.
[2020-07-17 22:51:54,641 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states.
[2020-07-17 22:51:54,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:54,643 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions.
[2020-07-17 22:51:54,643 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2020-07-17 22:51:54,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:54,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:54,644 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand 21 states.
[2020-07-17 22:51:54,644 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 21 states.
[2020-07-17 22:51:54,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:54,646 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions.
[2020-07-17 22:51:54,647 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2020-07-17 22:51:54,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:54,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:54,647 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-17 22:51:54,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-17 22:51:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states.
[2020-07-17 22:51:54,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions.
[2020-07-17 22:51:54,649 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 15
[2020-07-17 22:51:54,650 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-17 22:51:54,650 INFO L479 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions.
[2020-07-17 22:51:54,650 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-17 22:51:54,650 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions.
[2020-07-17 22:51:54,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21
[2020-07-17 22:51:54,651 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-17 22:51:54,651 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-17 22:51:54,864 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-17 22:51:54,865 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-17 22:51:54,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-17 22:51:54,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1734889408, now seen corresponding path program 2 times
[2020-07-17 22:51:54,866 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-17 22:51:54,867 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051251676]
[2020-07-17 22:51:54,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-17 22:51:54,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,944 INFO L280 TraceCheckUtils]: 0: Hoare triple {520#true} assume true; {520#true} is VALID
[2020-07-17 22:51:54,944 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {520#true} {520#true} #65#return; {520#true} is VALID
[2020-07-17 22:51:54,944 INFO L263 TraceCheckUtils]: 0: Hoare triple {520#true} call ULTIMATE.init(); {520#true} is VALID
[2020-07-17 22:51:54,945 INFO L280 TraceCheckUtils]: 1: Hoare triple {520#true} assume true; {520#true} is VALID
[2020-07-17 22:51:54,945 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {520#true} {520#true} #65#return; {520#true} is VALID
[2020-07-17 22:51:54,945 INFO L263 TraceCheckUtils]: 3: Hoare triple {520#true} call #t~ret0 := main(); {520#true} is VALID
[2020-07-17 22:51:54,947 INFO L280 TraceCheckUtils]: 4: Hoare triple {520#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {524#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} is VALID
[2020-07-17 22:51:54,948 INFO L280 TraceCheckUtils]: 5: Hoare triple {524#(<= (+ (* 2 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {525#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} is VALID
[2020-07-17 22:51:54,949 INFO L280 TraceCheckUtils]: 6: Hoare triple {525#(<= (+ (* 2 main_~i~0) main_~j~0 98) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {526#(<= (+ main_~i~0 main_~j~0 98) 0)} is VALID
[2020-07-17 22:51:54,951 INFO L280 TraceCheckUtils]: 7: Hoare triple {526#(<= (+ main_~i~0 main_~j~0 98) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {527#(<= (+ main_~j~0 98) 0)} is VALID
[2020-07-17 22:51:54,952 INFO L280 TraceCheckUtils]: 8: Hoare triple {527#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {521#false} is VALID
[2020-07-17 22:51:54,952 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID
[2020-07-17 22:51:54,952 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID
[2020-07-17 22:51:54,953 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {521#false} is VALID
[2020-07-17 22:51:54,953 INFO L280 TraceCheckUtils]: 12: Hoare triple {521#false} assume !(~j~0 < 20); {521#false} is VALID
[2020-07-17 22:51:54,953 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID
[2020-07-17 22:51:54,954 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID
[2020-07-17 22:51:54,954 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#false} assume !(~i~0 <= 100); {521#false} is VALID
[2020-07-17 22:51:54,954 INFO L263 TraceCheckUtils]: 16: Hoare triple {521#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {521#false} is VALID
[2020-07-17 22:51:54,954 INFO L280 TraceCheckUtils]: 17: Hoare triple {521#false} ~cond := #in~cond; {521#false} is VALID
[2020-07-17 22:51:54,955 INFO L280 TraceCheckUtils]: 18: Hoare triple {521#false} assume 0 == ~cond; {521#false} is VALID
[2020-07-17 22:51:54,955 INFO L280 TraceCheckUtils]: 19: Hoare triple {521#false} assume !false; {521#false} is VALID
[2020-07-17 22:51:54,956 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2020-07-17 22:51:54,956 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051251676]
[2020-07-17 22:51:54,957 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561196331]
[2020-07-17 22:51:54,957 INFO L92 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)
[2020-07-17 22:51:54,988 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2020-07-17 22:51:54,989 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,990 INFO L264 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 6 conjunts are in the unsatisfiable core
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-17 22:51:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:54,999 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-17 22:51:55,137 INFO L263 TraceCheckUtils]: 0: Hoare triple {520#true} call ULTIMATE.init(); {520#true} is VALID
[2020-07-17 22:51:55,137 INFO L280 TraceCheckUtils]: 1: Hoare triple {520#true} assume true; {520#true} is VALID
[2020-07-17 22:51:55,138 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {520#true} {520#true} #65#return; {520#true} is VALID
[2020-07-17 22:51:55,138 INFO L263 TraceCheckUtils]: 3: Hoare triple {520#true} call #t~ret0 := main(); {520#true} is VALID
[2020-07-17 22:51:55,139 INFO L280 TraceCheckUtils]: 4: Hoare triple {520#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {543#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} is VALID
[2020-07-17 22:51:55,141 INFO L280 TraceCheckUtils]: 5: Hoare triple {543#(and (<= main_~i~0 0) (<= (+ main_~j~0 100) 0))} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {547#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 1))} is VALID
[2020-07-17 22:51:55,142 INFO L280 TraceCheckUtils]: 6: Hoare triple {547#(and (<= (+ main_~j~0 100) 0) (<= main_~i~0 1))} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {551#(and (<= (+ main_~j~0 100) main_~i~0) (<= main_~i~0 1))} is VALID
[2020-07-17 22:51:55,144 INFO L280 TraceCheckUtils]: 7: Hoare triple {551#(and (<= (+ main_~j~0 100) main_~i~0) (<= main_~i~0 1))} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {527#(<= (+ main_~j~0 98) 0)} is VALID
[2020-07-17 22:51:55,145 INFO L280 TraceCheckUtils]: 8: Hoare triple {527#(<= (+ main_~j~0 98) 0)} assume !(~j~0 < 20); {521#false} is VALID
[2020-07-17 22:51:55,145 INFO L280 TraceCheckUtils]: 9: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID
[2020-07-17 22:51:55,146 INFO L280 TraceCheckUtils]: 10: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID
[2020-07-17 22:51:55,146 INFO L280 TraceCheckUtils]: 11: Hoare triple {521#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {521#false} is VALID
[2020-07-17 22:51:55,146 INFO L280 TraceCheckUtils]: 12: Hoare triple {521#false} assume !(~j~0 < 20); {521#false} is VALID
[2020-07-17 22:51:55,147 INFO L280 TraceCheckUtils]: 13: Hoare triple {521#false} ~k~0 := 4; {521#false} is VALID
[2020-07-17 22:51:55,147 INFO L280 TraceCheckUtils]: 14: Hoare triple {521#false} assume !(~k~0 <= 3); {521#false} is VALID
[2020-07-17 22:51:55,147 INFO L280 TraceCheckUtils]: 15: Hoare triple {521#false} assume !(~i~0 <= 100); {521#false} is VALID
[2020-07-17 22:51:55,148 INFO L263 TraceCheckUtils]: 16: Hoare triple {521#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {521#false} is VALID
[2020-07-17 22:51:55,148 INFO L280 TraceCheckUtils]: 17: Hoare triple {521#false} ~cond := #in~cond; {521#false} is VALID
[2020-07-17 22:51:55,148 INFO L280 TraceCheckUtils]: 18: Hoare triple {521#false} assume 0 == ~cond; {521#false} is VALID
[2020-07-17 22:51:55,148 INFO L280 TraceCheckUtils]: 19: Hoare triple {521#false} assume !false; {521#false} is VALID
[2020-07-17 22:51:55,150 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2020-07-17 22:51:55,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-17 22:51:55,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9
[2020-07-17 22:51:55,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995005416]
[2020-07-17 22:51:55,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20
[2020-07-17 22:51:55,152 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-17 22:51:55,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states.
[2020-07-17 22:51:55,183 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:55,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states
[2020-07-17 22:51:55,184 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-17 22:51:55,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants.
[2020-07-17 22:51:55,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72
[2020-07-17 22:51:55,185 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 9 states.
[2020-07-17 22:51:55,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:55,386 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions.
[2020-07-17 22:51:55,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-07-17 22:51:55,387 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 20
[2020-07-17 22:51:55,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-17 22:51:55,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-17 22:51:55,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions.
[2020-07-17 22:51:55,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states.
[2020-07-17 22:51:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions.
[2020-07-17 22:51:55,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 32 transitions.
[2020-07-17 22:51:55,428 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:55,429 INFO L225 Difference]: With dead ends: 34
[2020-07-17 22:51:55,429 INFO L226 Difference]: Without dead ends: 22
[2020-07-17 22:51:55,430 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110
[2020-07-17 22:51:55,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states.
[2020-07-17 22:51:55,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22.
[2020-07-17 22:51:55,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-17 22:51:55,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states.
[2020-07-17 22:51:55,451 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states.
[2020-07-17 22:51:55,452 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states.
[2020-07-17 22:51:55,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:55,454 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions.
[2020-07-17 22:51:55,454 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions.
[2020-07-17 22:51:55,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:55,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:55,455 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states.
[2020-07-17 22:51:55,455 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states.
[2020-07-17 22:51:55,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:55,457 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions.
[2020-07-17 22:51:55,457 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions.
[2020-07-17 22:51:55,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:55,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:55,458 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-17 22:51:55,458 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-17 22:51:55,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states.
[2020-07-17 22:51:55,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions.
[2020-07-17 22:51:55,460 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 20
[2020-07-17 22:51:55,460 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-17 22:51:55,461 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions.
[2020-07-17 22:51:55,461 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states.
[2020-07-17 22:51:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions.
[2020-07-17 22:51:55,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2020-07-17 22:51:55,462 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-17 22:51:55,462 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-17 22:51:55,674 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-17 22:51:55,675 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-17 22:51:55,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-17 22:51:55,675 INFO L82 PathProgramCache]: Analyzing trace with hash 1612949224, now seen corresponding path program 3 times
[2020-07-17 22:51:55,675 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-17 22:51:55,675 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207679542]
[2020-07-17 22:51:55,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-17 22:51:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:55,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:55,783 INFO L280 TraceCheckUtils]: 0: Hoare triple {733#true} assume true; {733#true} is VALID
[2020-07-17 22:51:55,784 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {733#true} {733#true} #65#return; {733#true} is VALID
[2020-07-17 22:51:55,784 INFO L263 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID
[2020-07-17 22:51:55,784 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID
[2020-07-17 22:51:55,784 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #65#return; {733#true} is VALID
[2020-07-17 22:51:55,785 INFO L263 TraceCheckUtils]: 3: Hoare triple {733#true} call #t~ret0 := main(); {733#true} is VALID
[2020-07-17 22:51:55,786 INFO L280 TraceCheckUtils]: 4: Hoare triple {733#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {737#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} is VALID
[2020-07-17 22:51:55,799 INFO L280 TraceCheckUtils]: 5: Hoare triple {737#(<= (+ (* 3 main_~i~0) main_~j~0 100) 0)} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {738#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} is VALID
[2020-07-17 22:51:55,801 INFO L280 TraceCheckUtils]: 6: Hoare triple {738#(<= (+ (* 3 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {739#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} is VALID
[2020-07-17 22:51:55,802 INFO L280 TraceCheckUtils]: 7: Hoare triple {739#(<= (+ (* 2 main_~i~0) main_~j~0 97) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {740#(<= (+ main_~i~0 main_~j~0 97) 0)} is VALID
[2020-07-17 22:51:55,804 INFO L280 TraceCheckUtils]: 8: Hoare triple {740#(<= (+ main_~i~0 main_~j~0 97) 0)} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {741#(<= (+ main_~j~0 97) 0)} is VALID
[2020-07-17 22:51:55,805 INFO L280 TraceCheckUtils]: 9: Hoare triple {741#(<= (+ main_~j~0 97) 0)} assume !(~j~0 < 20); {734#false} is VALID
[2020-07-17 22:51:55,805 INFO L280 TraceCheckUtils]: 10: Hoare triple {734#false} ~k~0 := 4; {734#false} is VALID
[2020-07-17 22:51:55,805 INFO L280 TraceCheckUtils]: 11: Hoare triple {734#false} assume !(~k~0 <= 3); {734#false} is VALID
[2020-07-17 22:51:55,805 INFO L280 TraceCheckUtils]: 12: Hoare triple {734#false} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {734#false} is VALID
[2020-07-17 22:51:55,806 INFO L280 TraceCheckUtils]: 13: Hoare triple {734#false} assume !(~j~0 < 20); {734#false} is VALID
[2020-07-17 22:51:55,806 INFO L280 TraceCheckUtils]: 14: Hoare triple {734#false} ~k~0 := 4; {734#false} is VALID
[2020-07-17 22:51:55,806 INFO L280 TraceCheckUtils]: 15: Hoare triple {734#false} assume !(~k~0 <= 3); {734#false} is VALID
[2020-07-17 22:51:55,810 INFO L280 TraceCheckUtils]: 16: Hoare triple {734#false} assume !(~i~0 <= 100); {734#false} is VALID
[2020-07-17 22:51:55,810 INFO L263 TraceCheckUtils]: 17: Hoare triple {734#false} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {734#false} is VALID
[2020-07-17 22:51:55,810 INFO L280 TraceCheckUtils]: 18: Hoare triple {734#false} ~cond := #in~cond; {734#false} is VALID
[2020-07-17 22:51:55,810 INFO L280 TraceCheckUtils]: 19: Hoare triple {734#false} assume 0 == ~cond; {734#false} is VALID
[2020-07-17 22:51:55,811 INFO L280 TraceCheckUtils]: 20: Hoare triple {734#false} assume !false; {734#false} is VALID
[2020-07-17 22:51:55,812 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2020-07-17 22:51:55,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207679542]
[2020-07-17 22:51:55,813 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958833982]
[2020-07-17 22:51:55,813 INFO L92 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)
Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-17 22:51:55,846 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2020-07-17 22:51:55,846 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-17 22:51:55,847 INFO L264 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 5 conjunts are in the unsatisfiable core
[2020-07-17 22:51:55,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-17 22:51:55,859 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-17 22:51:55,929 INFO L263 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {733#true} is VALID
[2020-07-17 22:51:55,930 INFO L280 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID
[2020-07-17 22:51:55,930 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #65#return; {733#true} is VALID
[2020-07-17 22:51:55,930 INFO L263 TraceCheckUtils]: 3: Hoare triple {733#true} call #t~ret0 := main(); {733#true} is VALID
[2020-07-17 22:51:55,930 INFO L280 TraceCheckUtils]: 4: Hoare triple {733#true} havoc ~i~0;havoc ~j~0;havoc ~k~0;~i~0 := 0;~k~0 := 9;~j~0 := -100; {733#true} is VALID
[2020-07-17 22:51:55,931 INFO L280 TraceCheckUtils]: 5: Hoare triple {733#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {733#true} is VALID
[2020-07-17 22:51:55,931 INFO L280 TraceCheckUtils]: 6: Hoare triple {733#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {733#true} is VALID
[2020-07-17 22:51:55,931 INFO L280 TraceCheckUtils]: 7: Hoare triple {733#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {733#true} is VALID
[2020-07-17 22:51:55,931 INFO L280 TraceCheckUtils]: 8: Hoare triple {733#true} assume !!(~j~0 < 20);~j~0 := ~i~0 + ~j~0; {733#true} is VALID
[2020-07-17 22:51:55,932 INFO L280 TraceCheckUtils]: 9: Hoare triple {733#true} assume !(~j~0 < 20); {733#true} is VALID
[2020-07-17 22:51:55,932 INFO L280 TraceCheckUtils]: 10: Hoare triple {733#true} ~k~0 := 4; {733#true} is VALID
[2020-07-17 22:51:55,932 INFO L280 TraceCheckUtils]: 11: Hoare triple {733#true} assume !(~k~0 <= 3); {733#true} is VALID
[2020-07-17 22:51:55,932 INFO L280 TraceCheckUtils]: 12: Hoare triple {733#true} assume !!(~i~0 <= 100);~i~0 := 1 + ~i~0; {733#true} is VALID
[2020-07-17 22:51:55,933 INFO L280 TraceCheckUtils]: 13: Hoare triple {733#true} assume !(~j~0 < 20); {733#true} is VALID
[2020-07-17 22:51:55,934 INFO L280 TraceCheckUtils]: 14: Hoare triple {733#true} ~k~0 := 4; {787#(= 4 main_~k~0)} is VALID
[2020-07-17 22:51:55,934 INFO L280 TraceCheckUtils]: 15: Hoare triple {787#(= 4 main_~k~0)} assume !(~k~0 <= 3); {787#(= 4 main_~k~0)} is VALID
[2020-07-17 22:51:55,935 INFO L280 TraceCheckUtils]: 16: Hoare triple {787#(= 4 main_~k~0)} assume !(~i~0 <= 100); {787#(= 4 main_~k~0)} is VALID
[2020-07-17 22:51:55,936 INFO L263 TraceCheckUtils]: 17: Hoare triple {787#(= 4 main_~k~0)} call __VERIFIER_assert((if 4 == ~k~0 then 1 else 0)); {797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID
[2020-07-17 22:51:55,937 INFO L280 TraceCheckUtils]: 18: Hoare triple {797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {801#(<= 1 __VERIFIER_assert_~cond)} is VALID
[2020-07-17 22:51:55,938 INFO L280 TraceCheckUtils]: 19: Hoare triple {801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {734#false} is VALID
[2020-07-17 22:51:55,938 INFO L280 TraceCheckUtils]: 20: Hoare triple {734#false} assume !false; {734#false} is VALID
[2020-07-17 22:51:55,939 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2020-07-17 22:51:55,939 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2020-07-17 22:51:55,939 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10
[2020-07-17 22:51:55,940 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800616592]
[2020-07-17 22:51:55,940 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2020-07-17 22:51:55,940 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-17 22:51:55,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states.
[2020-07-17 22:51:55,959 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:55,959 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states
[2020-07-17 22:51:55,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-17 22:51:55,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2020-07-17 22:51:55,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90
[2020-07-17 22:51:55,960 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand 5 states.
[2020-07-17 22:51:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:56,047 INFO L93 Difference]: Finished difference Result 31 states and 39 transitions.
[2020-07-17 22:51:56,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2020-07-17 22:51:56,048 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21
[2020-07-17 22:51:56,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-17 22:51:56,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-17 22:51:56,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions.
[2020-07-17 22:51:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states.
[2020-07-17 22:51:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions.
[2020-07-17 22:51:56,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 30 transitions.
[2020-07-17 22:51:56,084 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-17 22:51:56,084 INFO L225 Difference]: With dead ends: 31
[2020-07-17 22:51:56,085 INFO L226 Difference]: Without dead ends: 0
[2020-07-17 22:51:56,086 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110
[2020-07-17 22:51:56,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2020-07-17 22:51:56,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2020-07-17 22:51:56,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-17 22:51:56,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states.
[2020-07-17 22:51:56,087 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-17 22:51:56,087 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-17 22:51:56,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:56,087 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-17 22:51:56,087 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-17 22:51:56,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:56,088 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:56,088 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-17 22:51:56,088 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-17 22:51:56,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-17 22:51:56,088 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-17 22:51:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-17 22:51:56,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:56,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-17 22:51:56,089 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-17 22:51:56,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-17 22:51:56,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2020-07-17 22:51:56,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2020-07-17 22:51:56,089 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 21
[2020-07-17 22:51:56,090 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-17 22:51:56,090 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2020-07-17 22:51:56,090 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states.
[2020-07-17 22:51:56,090 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-17 22:51:56,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-17 22:51:56,299 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-17 22:51:56,304 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2020-07-17 22:51:56,374 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true
[2020-07-17 22:51:56,375 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2020-07-17 22:51:56,375 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2020-07-17 22:51:56,375 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true
[2020-07-17 22:51:56,375 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2020-07-17 22:51:56,375 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2020-07-17 22:51:56,375 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 3 5) no Hoare annotation was computed.
[2020-07-17 22:51:56,375 INFO L268 CegarLoopResult]: For program point L4(line 4) no Hoare annotation was computed.
[2020-07-17 22:51:56,376 INFO L268 CegarLoopResult]: For program point L4-2(lines 3 5) no Hoare annotation was computed.
[2020-07-17 22:51:56,376 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 3 5) no Hoare annotation was computed.
[2020-07-17 22:51:56,376 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 13 30) no Hoare annotation was computed.
[2020-07-17 22:51:56,376 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 13 30) no Hoare annotation was computed.
[2020-07-17 22:51:56,376 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true
[2020-07-17 22:51:56,376 INFO L268 CegarLoopResult]: For program point L28(line 28) no Hoare annotation was computed.
[2020-07-17 22:51:56,376 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 26) the Hoare annotation is: (= 4 main_~k~0)
[2020-07-17 22:51:56,377 INFO L264 CegarLoopResult]: At program point L24-3(lines 18 27) the Hoare annotation is: (or (= 4 main_~k~0) (and (<= main_~i~0 0) (<= (+ main_~j~0 100) main_~i~0)))
[2020-07-17 22:51:56,377 INFO L264 CegarLoopResult]: At program point L20-2(lines 20 22) the Hoare annotation is: (or (= 4 main_~k~0) (<= main_~i~0 1))
[2020-07-17 22:51:56,377 INFO L268 CegarLoopResult]: For program point L20-3(lines 20 22) no Hoare annotation was computed.
[2020-07-17 22:51:56,377 INFO L264 CegarLoopResult]: At program point L18-2(lines 18 27) the Hoare annotation is: (= 4 main_~k~0)
[2020-07-17 22:51:56,377 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 6 11) the Hoare annotation is: true
[2020-07-17 22:51:56,377 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 6 11) no Hoare annotation was computed.
[2020-07-17 22:51:56,377 INFO L268 CegarLoopResult]: For program point L8(line 8) no Hoare annotation was computed.
[2020-07-17 22:51:56,378 INFO L268 CegarLoopResult]: For program point L7(lines 7 9) no Hoare annotation was computed.
[2020-07-17 22:51:56,378 INFO L268 CegarLoopResult]: For program point L7-2(lines 6 11) no Hoare annotation was computed.
[2020-07-17 22:51:56,378 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 8) no Hoare annotation was computed.
[2020-07-17 22:51:56,382 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2020-07-17 22:51:56,383 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2020-07-17 22:51:56,384 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2020-07-17 22:51:56,384 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2020-07-17 22:51:56,384 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-17 22:51:56,384 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation
[2020-07-17 22:51:56,384 WARN L170 areAnnotationChecker]: L4 has no Hoare annotation
[2020-07-17 22:51:56,386 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2020-07-17 22:51:56,387 WARN L170 areAnnotationChecker]: L7 has no Hoare annotation
[2020-07-17 22:51:56,387 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-17 22:51:56,387 WARN L170 areAnnotationChecker]: L4-2 has no Hoare annotation
[2020-07-17 22:51:56,387 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2020-07-17 22:51:56,387 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation
[2020-07-17 22:51:56,387 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation
[2020-07-17 22:51:56,388 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation
[2020-07-17 22:51:56,388 WARN L170 areAnnotationChecker]: L8 has no Hoare annotation
[2020-07-17 22:51:56,388 WARN L170 areAnnotationChecker]: L7-2 has no Hoare annotation
[2020-07-17 22:51:56,388 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation
[2020-07-17 22:51:56,388 WARN L170 areAnnotationChecker]: L20-3 has no Hoare annotation
[2020-07-17 22:51:56,388 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation
[2020-07-17 22:51:56,388 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2020-07-17 22:51:56,390 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2020-07-17 22:51:56,390 INFO L163 areAnnotationChecker]: CFG has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-17 22:51:56,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:51:56 BoogieIcfgContainer
[2020-07-17 22:51:56,402 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-17 22:51:56,405 INFO L168 Benchmark]: Toolchain (without parser) took 4109.28 ms. Allocated memory was 142.6 MB in the beginning and 251.7 MB in the end (delta: 109.1 MB). Free memory was 99.7 MB in the beginning and 122.0 MB in the end (delta: -22.3 MB). Peak memory consumption was 86.7 MB. Max. memory is 7.1 GB.
[2020-07-17 22:51:56,406 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 142.6 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
[2020-07-17 22:51:56,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 298.28 ms. Allocated memory is still 142.6 MB. Free memory was 99.5 MB in the beginning and 89.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB.
[2020-07-17 22:51:56,408 INFO L168 Benchmark]: Boogie Preprocessor took 114.02 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.8 MB in the beginning and 179.9 MB in the end (delta: -90.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB.
[2020-07-17 22:51:56,408 INFO L168 Benchmark]: RCFGBuilder took 324.52 ms. Allocated memory is still 199.8 MB. Free memory was 179.9 MB in the beginning and 162.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB.
[2020-07-17 22:51:56,409 INFO L168 Benchmark]: TraceAbstraction took 3364.31 ms. Allocated memory was 199.8 MB in the beginning and 251.7 MB in the end (delta: 51.9 MB). Free memory was 162.0 MB in the beginning and 122.0 MB in the end (delta: 40.0 MB). Peak memory consumption was 91.9 MB. Max. memory is 7.1 GB.
[2020-07-17 22:51:56,413 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.56 ms. Allocated memory is still 142.6 MB. Free memory was 118.3 MB in the beginning and 118.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 298.28 ms. Allocated memory is still 142.6 MB. Free memory was 99.5 MB in the beginning and 89.8 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 114.02 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 89.8 MB in the beginning and 179.9 MB in the end (delta: -90.1 MB). Peak memory consumption was 11.1 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 324.52 ms. Allocated memory is still 199.8 MB. Free memory was 179.9 MB in the beginning and 162.7 MB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 3364.31 ms. Allocated memory was 199.8 MB in the beginning and 251.7 MB in the end (delta: 51.9 MB). Free memory was 162.0 MB in the beginning and 122.0 MB in the end (delta: 40.0 MB). Peak memory consumption was 91.9 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 8]: 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: 24]: Loop Invariant
Derived loop invariant: 4 == k
- InvariantResult [Line: 20]: Loop Invariant
Derived loop invariant: 4 == k || i <= 1
- InvariantResult [Line: 18]: Loop Invariant
Derived loop invariant: 4 == k || (i <= 0 && j + 100 <= i)
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 5 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.1s, OverallIterations: 6, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 96 SDtfs, 5 SDslu, 188 SDs, 0 SdLazy, 56 SolverSat, 8 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 97 GetRequests, 68 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=22occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 26 NumberOfFragments, 31 HoareAnnotationTreeSize, 15 FomulaSimplifications, 63 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 16 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 146 NumberOfCodeBlocks, 139 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 137 ConstructedInterpolants, 0 QuantifiedInterpolants, 4500 SizeOfPredicates, 5 NumberOfNonLiveVariables, 115 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 43/57 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...