/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/gsv2008.c.i.p+cfa-reducer.c
--------------------------------------------------------------------------------
This is Ultimate 0.1.25-8fc6572
[2020-07-10 15:29:13,873 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2020-07-10 15:29:13,875 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2020-07-10 15:29:13,890 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2020-07-10 15:29:13,890 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2020-07-10 15:29:13,892 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2020-07-10 15:29:13,893 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2020-07-10 15:29:13,896 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2020-07-10 15:29:13,898 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2020-07-10 15:29:13,899 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2020-07-10 15:29:13,900 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2020-07-10 15:29:13,901 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2020-07-10 15:29:13,902 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2020-07-10 15:29:13,903 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2020-07-10 15:29:13,904 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2020-07-10 15:29:13,905 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2020-07-10 15:29:13,906 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2020-07-10 15:29:13,907 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2020-07-10 15:29:13,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2020-07-10 15:29:13,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2020-07-10 15:29:13,912 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2020-07-10 15:29:13,913 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2020-07-10 15:29:13,915 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2020-07-10 15:29:13,916 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2020-07-10 15:29:13,919 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2020-07-10 15:29:13,919 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2020-07-10 15:29:13,919 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2020-07-10 15:29:13,921 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2020-07-10 15:29:13,921 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2020-07-10 15:29:13,922 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2020-07-10 15:29:13,923 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2020-07-10 15:29:13,924 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2020-07-10 15:29:13,924 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2020-07-10 15:29:13,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2020-07-10 15:29:13,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2020-07-10 15:29:13,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2020-07-10 15:29:13,927 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2020-07-10 15:29:13,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2020-07-10 15:29:13,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2020-07-10 15:29:13,929 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2020-07-10 15:29:13,930 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2020-07-10 15:29:13,931 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-10 15:29:13,946 INFO L113 SettingsManager]: Loading preferences was successful
[2020-07-10 15:29:13,947 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2020-07-10 15:29:13,948 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2020-07-10 15:29:13,949 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2020-07-10 15:29:13,949 INFO L138 SettingsManager]: * Use SBE=true
[2020-07-10 15:29:13,949 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2020-07-10 15:29:13,949 INFO L138 SettingsManager]: * sizeof long=4
[2020-07-10 15:29:13,950 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2020-07-10 15:29:13,950 INFO L138 SettingsManager]: * sizeof POINTER=4
[2020-07-10 15:29:13,950 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2020-07-10 15:29:13,950 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2020-07-10 15:29:13,950 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2020-07-10 15:29:13,951 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2020-07-10 15:29:13,951 INFO L138 SettingsManager]: * sizeof long double=12
[2020-07-10 15:29:13,951 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2020-07-10 15:29:13,951 INFO L138 SettingsManager]: * Use constant arrays=true
[2020-07-10 15:29:13,951 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2020-07-10 15:29:13,952 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2020-07-10 15:29:13,952 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2020-07-10 15:29:13,952 INFO L138 SettingsManager]: * To the following directory=./dump/
[2020-07-10 15:29:13,952 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2020-07-10 15:29:13,953 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2020-07-10 15:29:13,953 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2020-07-10 15:29:13,953 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2020-07-10 15:29:13,953 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2020-07-10 15:29:13,954 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2020-07-10 15:29:13,954 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2020-07-10 15:29:13,954 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2020-07-10 15:29:13,954 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE
[2020-07-10 15:29:13,954 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2020-07-10 15:29:14,321 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2020-07-10 15:29:14,336 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2020-07-10 15:29:14,340 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2020-07-10 15:29:14,341 INFO L271 PluginConnector]: Initializing CDTParser...
[2020-07-10 15:29:14,342 INFO L275 PluginConnector]: CDTParser initialized
[2020-07-10 15:29:14,343 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c
[2020-07-10 15:29:14,441 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125c41c3a/21d303b000de4ba6a208a580de7d9ff1/FLAG3a73867d1
[2020-07-10 15:29:14,975 INFO L306 CDTParser]: Found 1 translation units.
[2020-07-10 15:29:14,975 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-lit/gsv2008.c.i.p+cfa-reducer.c
[2020-07-10 15:29:14,983 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125c41c3a/21d303b000de4ba6a208a580de7d9ff1/FLAG3a73867d1
[2020-07-10 15:29:15,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/125c41c3a/21d303b000de4ba6a208a580de7d9ff1
[2020-07-10 15:29:15,387 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2020-07-10 15:29:15,390 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2020-07-10 15:29:15,391 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2020-07-10 15:29:15,391 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2020-07-10 15:29:15,396 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2020-07-10 15:29:15,397 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,401 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eee7641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15, skipping insertion in model container
[2020-07-10 15:29:15,401 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,410 INFO L145 MainTranslator]: Starting translation in SV-COMP mode
[2020-07-10 15:29:15,433 INFO L178 MainTranslator]: Built tables and reachable declarations
[2020-07-10 15:29:15,647 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:29:15,660 INFO L203 MainTranslator]: Completed pre-run
[2020-07-10 15:29:15,680 INFO L206 PostProcessor]: Analyzing one entry point: main
[2020-07-10 15:29:15,695 INFO L208 MainTranslator]: Completed translation
[2020-07-10 15:29:15,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15 WrapperNode
[2020-07-10 15:29:15,696 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2020-07-10 15:29:15,697 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2020-07-10 15:29:15,697 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2020-07-10 15:29:15,697 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2020-07-10 15:29:15,708 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,725 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,727 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (1/1) ...
[2020-07-10 15:29:15,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2020-07-10 15:29:15,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2020-07-10 15:29:15,730 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2020-07-10 15:29:15,730 INFO L275 PluginConnector]: RCFGBuilder initialized
[2020-07-10 15:29:15,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (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-10 15:29:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2020-07-10 15:29:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2020-07-10 15:29:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not
[2020-07-10 15:29:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2020-07-10 15:29:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2020-07-10 15:29:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2020-07-10 15:29:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not
[2020-07-10 15:29:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert
[2020-07-10 15:29:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2020-07-10 15:29:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2020-07-10 15:29:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2020-07-10 15:29:15,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2020-07-10 15:29:16,180 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2020-07-10 15:29:16,181 INFO L295 CfgBuilder]: Removed 0 assume(true) statements.
[2020-07-10 15:29:16,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:16 BoogieIcfgContainer
[2020-07-10 15:29:16,186 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2020-07-10 15:29:16,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2020-07-10 15:29:16,188 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2020-07-10 15:29:16,192 INFO L275 PluginConnector]: TraceAbstraction initialized
[2020-07-10 15:29:16,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.07 03:29:15" (1/3) ...
[2020-07-10 15:29:16,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483835b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:16, skipping insertion in model container
[2020-07-10 15:29:16,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.07 03:29:15" (2/3) ...
[2020-07-10 15:29:16,196 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@483835b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.07 03:29:16, skipping insertion in model container
[2020-07-10 15:29:16,196 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.07 03:29:16" (3/3) ...
[2020-07-10 15:29:16,199 INFO L109 eAbstractionObserver]: Analyzing ICFG gsv2008.c.i.p+cfa-reducer.c
[2020-07-10 15:29:16,215 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2020-07-10 15:29:16,224 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2020-07-10 15:29:16,244 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2020-07-10 15:29:16,284 INFO L375 AbstractCegarLoop]: Interprodecural is true
[2020-07-10 15:29:16,285 INFO L376 AbstractCegarLoop]: Hoare is true
[2020-07-10 15:29:16,285 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP
[2020-07-10 15:29:16,286 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2020-07-10 15:29:16,287 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2020-07-10 15:29:16,287 INFO L380 AbstractCegarLoop]: Difference is false
[2020-07-10 15:29:16,287 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2020-07-10 15:29:16,287 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2020-07-10 15:29:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states.
[2020-07-10 15:29:16,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12
[2020-07-10 15:29:16,326 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:29:16,328 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 15:29:16,329 INFO L427 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:29:16,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:29:16,339 INFO L82 PathProgramCache]: Analyzing trace with hash 1330899215, now seen corresponding path program 1 times
[2020-07-10 15:29:16,354 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:29:16,355 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486649877]
[2020-07-10 15:29:16,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:29:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:16,601 INFO L280 TraceCheckUtils]: 0: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {19#true} is VALID
[2020-07-10 15:29:16,602 INFO L280 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID
[2020-07-10 15:29:16,602 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #36#return; {19#true} is VALID
[2020-07-10 15:29:16,606 INFO L263 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID
[2020-07-10 15:29:16,606 INFO L280 TraceCheckUtils]: 1: Hoare triple {25#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {19#true} is VALID
[2020-07-10 15:29:16,607 INFO L280 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID
[2020-07-10 15:29:16,607 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #36#return; {19#true} is VALID
[2020-07-10 15:29:16,607 INFO L263 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret1 := main(); {19#true} is VALID
[2020-07-10 15:29:16,612 INFO L280 TraceCheckUtils]: 5: Hoare triple {19#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {24#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:16,619 INFO L280 TraceCheckUtils]: 6: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {24#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:16,620 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {24#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:16,621 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#(<= (+ main_~main__x~0 50) 0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {20#false} is VALID
[2020-07-10 15:29:16,621 INFO L280 TraceCheckUtils]: 9: Hoare triple {20#false} assume 0 == ~__VERIFIER_assert__cond~0; {20#false} is VALID
[2020-07-10 15:29:16,622 INFO L280 TraceCheckUtils]: 10: Hoare triple {20#false} assume !false; {20#false} is VALID
[2020-07-10 15:29:16,623 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-10 15:29:16,624 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486649877]
[2020-07-10 15:29:16,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2020-07-10 15:29:16,625 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2020-07-10 15:29:16,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097508140]
[2020-07-10 15:29:16,633 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-07-10 15:29:16,635 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:29:16,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-10 15:29:16,685 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:29:16,686 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-10 15:29:16,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:29:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-10 15:29:16,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2020-07-10 15:29:16,702 INFO L87 Difference]: Start difference. First operand 16 states. Second operand 4 states.
[2020-07-10 15:29:16,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:16,876 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions.
[2020-07-10 15:29:16,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-07-10 15:29:16,877 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11
[2020-07-10 15:29:16,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:29:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-10 15:29:16,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions.
[2020-07-10 15:29:16,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-10 15:29:16,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions.
[2020-07-10 15:29:16,899 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 30 transitions.
[2020-07-10 15:29:16,977 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-10 15:29:16,992 INFO L225 Difference]: With dead ends: 26
[2020-07-10 15:29:16,993 INFO L226 Difference]: Without dead ends: 13
[2020-07-10 15:29:16,999 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2020-07-10 15:29:17,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states.
[2020-07-10 15:29:17,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13.
[2020-07-10 15:29:17,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:29:17,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand 13 states.
[2020-07-10 15:29:17,057 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states.
[2020-07-10 15:29:17,057 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states.
[2020-07-10 15:29:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:17,061 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions.
[2020-07-10 15:29:17,061 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2020-07-10 15:29:17,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:17,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:17,062 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand 13 states.
[2020-07-10 15:29:17,062 INFO L87 Difference]: Start difference. First operand 13 states. Second operand 13 states.
[2020-07-10 15:29:17,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:17,066 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions.
[2020-07-10 15:29:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2020-07-10 15:29:17,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:17,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:17,067 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:29:17,067 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:29:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states.
[2020-07-10 15:29:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions.
[2020-07-10 15:29:17,071 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11
[2020-07-10 15:29:17,072 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:29:17,072 INFO L479 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions.
[2020-07-10 15:29:17,072 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-10 15:29:17,072 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions.
[2020-07-10 15:29:17,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2020-07-10 15:29:17,073 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:29:17,073 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 15:29:17,074 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2020-07-10 15:29:17,074 INFO L427 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:29:17,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:29:17,075 INFO L82 PathProgramCache]: Analyzing trace with hash -1691859760, now seen corresponding path program 1 times
[2020-07-10 15:29:17,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:29:17,076 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572920204]
[2020-07-10 15:29:17,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:29:17,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:17,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:17,220 INFO L280 TraceCheckUtils]: 0: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {107#true} is VALID
[2020-07-10 15:29:17,220 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#true} assume true; {107#true} is VALID
[2020-07-10 15:29:17,221 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {107#true} {107#true} #36#return; {107#true} is VALID
[2020-07-10 15:29:17,223 INFO L263 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID
[2020-07-10 15:29:17,223 INFO L280 TraceCheckUtils]: 1: Hoare triple {115#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {107#true} is VALID
[2020-07-10 15:29:17,224 INFO L280 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID
[2020-07-10 15:29:17,224 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #36#return; {107#true} is VALID
[2020-07-10 15:29:17,225 INFO L263 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret1 := main(); {107#true} is VALID
[2020-07-10 15:29:17,227 INFO L280 TraceCheckUtils]: 5: Hoare triple {107#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {112#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:17,228 INFO L280 TraceCheckUtils]: 6: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {112#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:17,230 INFO L280 TraceCheckUtils]: 7: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {112#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:17,233 INFO L280 TraceCheckUtils]: 8: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID
[2020-07-10 15:29:17,235 INFO L280 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {114#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID
[2020-07-10 15:29:17,237 INFO L280 TraceCheckUtils]: 10: Hoare triple {114#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {108#false} is VALID
[2020-07-10 15:29:17,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {108#false} assume !false; {108#false} is VALID
[2020-07-10 15:29:17,239 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 15:29:17,240 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572920204]
[2020-07-10 15:29:17,241 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [894701004]
[2020-07-10 15:29:17,241 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-10 15:29:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:17,292 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 7 conjunts are in the unsatisfiable core
[2020-07-10 15:29:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:17,308 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-10 15:29:17,455 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-10 15:29:17,500 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-10 15:29:17,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {107#true} call ULTIMATE.init(); {107#true} is VALID
[2020-07-10 15:29:17,539 INFO L280 TraceCheckUtils]: 1: Hoare triple {107#true} ~__return_main~0 := 0;~__return_144~0 := 0; {107#true} is VALID
[2020-07-10 15:29:17,539 INFO L280 TraceCheckUtils]: 2: Hoare triple {107#true} assume true; {107#true} is VALID
[2020-07-10 15:29:17,540 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {107#true} {107#true} #36#return; {107#true} is VALID
[2020-07-10 15:29:17,540 INFO L263 TraceCheckUtils]: 4: Hoare triple {107#true} call #t~ret1 := main(); {107#true} is VALID
[2020-07-10 15:29:17,542 INFO L280 TraceCheckUtils]: 5: Hoare triple {107#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {112#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:17,543 INFO L280 TraceCheckUtils]: 6: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {112#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:17,544 INFO L280 TraceCheckUtils]: 7: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {112#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:17,546 INFO L280 TraceCheckUtils]: 8: Hoare triple {112#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID
[2020-07-10 15:29:17,548 INFO L280 TraceCheckUtils]: 9: Hoare triple {113#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {146#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID
[2020-07-10 15:29:17,549 INFO L280 TraceCheckUtils]: 10: Hoare triple {146#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {108#false} is VALID
[2020-07-10 15:29:17,550 INFO L280 TraceCheckUtils]: 11: Hoare triple {108#false} assume !false; {108#false} is VALID
[2020-07-10 15:29:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 15:29:17,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-10 15:29:17,552 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7
[2020-07-10 15:29:17,554 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905525080]
[2020-07-10 15:29:17,555 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12
[2020-07-10 15:29:17,556 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:29:17,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states.
[2020-07-10 15:29:17,581 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:29:17,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states
[2020-07-10 15:29:17,582 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:29:17,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2020-07-10 15:29:17,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42
[2020-07-10 15:29:17,583 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states.
[2020-07-10 15:29:17,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:17,785 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions.
[2020-07-10 15:29:17,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states.
[2020-07-10 15:29:17,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12
[2020-07-10 15:29:17,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:29:17,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-10 15:29:17,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions.
[2020-07-10 15:29:17,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states.
[2020-07-10 15:29:17,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions.
[2020-07-10 15:29:17,791 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 17 transitions.
[2020-07-10 15:29:17,824 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-10 15:29:17,826 INFO L225 Difference]: With dead ends: 17
[2020-07-10 15:29:17,826 INFO L226 Difference]: Without dead ends: 14
[2020-07-10 15:29:17,828 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90
[2020-07-10 15:29:17,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states.
[2020-07-10 15:29:17,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14.
[2020-07-10 15:29:17,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:29:17,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand 14 states.
[2020-07-10 15:29:17,858 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2020-07-10 15:29:17,858 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2020-07-10 15:29:17,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:17,860 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions.
[2020-07-10 15:29:17,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2020-07-10 15:29:17,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:17,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:17,861 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand 14 states.
[2020-07-10 15:29:17,862 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 14 states.
[2020-07-10 15:29:17,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:17,864 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions.
[2020-07-10 15:29:17,864 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2020-07-10 15:29:17,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:17,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:17,865 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:29:17,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:29:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states.
[2020-07-10 15:29:17,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions.
[2020-07-10 15:29:17,867 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12
[2020-07-10 15:29:17,868 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:29:17,868 INFO L479 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions.
[2020-07-10 15:29:17,868 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states.
[2020-07-10 15:29:17,868 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions.
[2020-07-10 15:29:17,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2020-07-10 15:29:17,869 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:29:17,869 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 15:29:18,085 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1
[2020-07-10 15:29:18,085 INFO L427 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:29:18,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:29:18,086 INFO L82 PathProgramCache]: Analyzing trace with hash -908107473, now seen corresponding path program 2 times
[2020-07-10 15:29:18,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:29:18,087 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076134080]
[2020-07-10 15:29:18,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:29:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:18,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:18,209 INFO L280 TraceCheckUtils]: 0: Hoare triple {240#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {231#true} is VALID
[2020-07-10 15:29:18,210 INFO L280 TraceCheckUtils]: 1: Hoare triple {231#true} assume true; {231#true} is VALID
[2020-07-10 15:29:18,211 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {231#true} {231#true} #36#return; {231#true} is VALID
[2020-07-10 15:29:18,213 INFO L263 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {240#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID
[2020-07-10 15:29:18,213 INFO L280 TraceCheckUtils]: 1: Hoare triple {240#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {231#true} is VALID
[2020-07-10 15:29:18,214 INFO L280 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID
[2020-07-10 15:29:18,214 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #36#return; {231#true} is VALID
[2020-07-10 15:29:18,214 INFO L263 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret1 := main(); {231#true} is VALID
[2020-07-10 15:29:18,216 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {236#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:18,217 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {236#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:18,218 INFO L280 TraceCheckUtils]: 7: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {236#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:18,220 INFO L280 TraceCheckUtils]: 8: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID
[2020-07-10 15:29:18,222 INFO L280 TraceCheckUtils]: 9: Hoare triple {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID
[2020-07-10 15:29:18,223 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {239#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID
[2020-07-10 15:29:18,224 INFO L280 TraceCheckUtils]: 11: Hoare triple {239#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {232#false} is VALID
[2020-07-10 15:29:18,225 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#false} assume !false; {232#false} is VALID
[2020-07-10 15:29:18,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 15:29:18,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2076134080]
[2020-07-10 15:29:18,227 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698438948]
[2020-07-10 15:29:18,227 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)
Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 15:29:18,266 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2020-07-10 15:29:18,267 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-10 15:29:18,268 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 9 conjunts are in the unsatisfiable core
[2020-07-10 15:29:18,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:18,278 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-10 15:29:18,383 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-10 15:29:18,399 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-10 15:29:18,457 INFO L263 TraceCheckUtils]: 0: Hoare triple {231#true} call ULTIMATE.init(); {231#true} is VALID
[2020-07-10 15:29:18,458 INFO L280 TraceCheckUtils]: 1: Hoare triple {231#true} ~__return_main~0 := 0;~__return_144~0 := 0; {231#true} is VALID
[2020-07-10 15:29:18,458 INFO L280 TraceCheckUtils]: 2: Hoare triple {231#true} assume true; {231#true} is VALID
[2020-07-10 15:29:18,459 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} #36#return; {231#true} is VALID
[2020-07-10 15:29:18,459 INFO L263 TraceCheckUtils]: 4: Hoare triple {231#true} call #t~ret1 := main(); {231#true} is VALID
[2020-07-10 15:29:18,460 INFO L280 TraceCheckUtils]: 5: Hoare triple {231#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {236#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:18,461 INFO L280 TraceCheckUtils]: 6: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {236#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:18,462 INFO L280 TraceCheckUtils]: 7: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {236#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:18,464 INFO L280 TraceCheckUtils]: 8: Hoare triple {236#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID
[2020-07-10 15:29:18,466 INFO L280 TraceCheckUtils]: 9: Hoare triple {237#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID
[2020-07-10 15:29:18,468 INFO L280 TraceCheckUtils]: 10: Hoare triple {238#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {274#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID
[2020-07-10 15:29:18,469 INFO L280 TraceCheckUtils]: 11: Hoare triple {274#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {232#false} is VALID
[2020-07-10 15:29:18,470 INFO L280 TraceCheckUtils]: 12: Hoare triple {232#false} assume !false; {232#false} is VALID
[2020-07-10 15:29:18,470 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 15:29:18,471 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences.
[2020-07-10 15:29:18,471 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8
[2020-07-10 15:29:18,472 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328188055]
[2020-07-10 15:29:18,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13
[2020-07-10 15:29:18,473 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:29:18,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states.
[2020-07-10 15:29:18,497 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-10 15:29:18,498 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states
[2020-07-10 15:29:18,498 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:29:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2020-07-10 15:29:18,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2020-07-10 15:29:18,499 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states.
[2020-07-10 15:29:18,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:18,852 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions.
[2020-07-10 15:29:18,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2020-07-10 15:29:18,852 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13
[2020-07-10 15:29:18,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:29:18,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-10 15:29:18,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions.
[2020-07-10 15:29:18,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states.
[2020-07-10 15:29:18,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 18 transitions.
[2020-07-10 15:29:18,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 18 transitions.
[2020-07-10 15:29:18,899 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:29:18,900 INFO L225 Difference]: With dead ends: 18
[2020-07-10 15:29:18,900 INFO L226 Difference]: Without dead ends: 15
[2020-07-10 15:29:18,901 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2020-07-10 15:29:18,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states.
[2020-07-10 15:29:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15.
[2020-07-10 15:29:18,922 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:29:18,922 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states.
[2020-07-10 15:29:18,923 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states.
[2020-07-10 15:29:18,923 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states.
[2020-07-10 15:29:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:18,925 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2020-07-10 15:29:18,925 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2020-07-10 15:29:18,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:18,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:18,926 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states.
[2020-07-10 15:29:18,926 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states.
[2020-07-10 15:29:18,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:18,929 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2020-07-10 15:29:18,929 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2020-07-10 15:29:18,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:18,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:18,930 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:29:18,930 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:29:18,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states.
[2020-07-10 15:29:18,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions.
[2020-07-10 15:29:18,932 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13
[2020-07-10 15:29:18,932 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:29:18,932 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions.
[2020-07-10 15:29:18,933 INFO L480 AbstractCegarLoop]: Interpolant automaton has 8 states.
[2020-07-10 15:29:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions.
[2020-07-10 15:29:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15
[2020-07-10 15:29:18,934 INFO L414 BasicCegarLoop]: Found error trace
[2020-07-10 15:29:18,934 INFO L422 BasicCegarLoop]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2020-07-10 15:29:19,149 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 15:29:19,149 INFO L427 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2020-07-10 15:29:19,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2020-07-10 15:29:19,150 INFO L82 PathProgramCache]: Analyzing trace with hash 1913376944, now seen corresponding path program 3 times
[2020-07-10 15:29:19,150 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2020-07-10 15:29:19,151 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150963766]
[2020-07-10 15:29:19,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2020-07-10 15:29:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:19,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:19,371 INFO L280 TraceCheckUtils]: 0: Hoare triple {377#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {367#true} is VALID
[2020-07-10 15:29:19,371 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} assume true; {367#true} is VALID
[2020-07-10 15:29:19,372 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {367#true} {367#true} #36#return; {367#true} is VALID
[2020-07-10 15:29:19,373 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {377#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} is VALID
[2020-07-10 15:29:19,373 INFO L280 TraceCheckUtils]: 1: Hoare triple {377#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))} ~__return_main~0 := 0;~__return_144~0 := 0; {367#true} is VALID
[2020-07-10 15:29:19,374 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID
[2020-07-10 15:29:19,374 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #36#return; {367#true} is VALID
[2020-07-10 15:29:19,374 INFO L263 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret1 := main(); {367#true} is VALID
[2020-07-10 15:29:19,375 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {372#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:19,376 INFO L280 TraceCheckUtils]: 6: Hoare triple {372#(<= (+ main_~main__x~0 50) 0)} assume !!(-1000 < ~main__y~0); {372#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:19,377 INFO L280 TraceCheckUtils]: 7: Hoare triple {372#(<= (+ main_~main__x~0 50) 0)} assume !!(~main__y~0 < 1000000); {372#(<= (+ main_~main__x~0 50) 0)} is VALID
[2020-07-10 15:29:19,378 INFO L280 TraceCheckUtils]: 8: Hoare triple {372#(<= (+ main_~main__x~0 50) 0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {373#(<= (+ main_~main__x~0 51) main_~main__y~0)} is VALID
[2020-07-10 15:29:19,380 INFO L280 TraceCheckUtils]: 9: Hoare triple {373#(<= (+ main_~main__x~0 51) main_~main__y~0)} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {374#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} is VALID
[2020-07-10 15:29:19,382 INFO L280 TraceCheckUtils]: 10: Hoare triple {374#(<= (+ main_~main__x~0 53) (* 2 main_~main__y~0))} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {375#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} is VALID
[2020-07-10 15:29:19,384 INFO L280 TraceCheckUtils]: 11: Hoare triple {375#(<= (+ main_~main__x~0 56) (* 3 main_~main__y~0))} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {376#(not (= 0 main_~__VERIFIER_assert__cond~0))} is VALID
[2020-07-10 15:29:19,385 INFO L280 TraceCheckUtils]: 12: Hoare triple {376#(not (= 0 main_~__VERIFIER_assert__cond~0))} assume 0 == ~__VERIFIER_assert__cond~0; {368#false} is VALID
[2020-07-10 15:29:19,385 INFO L280 TraceCheckUtils]: 13: Hoare triple {368#false} assume !false; {368#false} is VALID
[2020-07-10 15:29:19,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2020-07-10 15:29:19,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150963766]
[2020-07-10 15:29:19,386 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [212991087]
[2020-07-10 15:29:19,386 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-10 15:29:19,413 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s)
[2020-07-10 15:29:19,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat
[2020-07-10 15:29:19,415 INFO L264 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 7 conjunts are in the unsatisfiable core
[2020-07-10 15:29:19,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2020-07-10 15:29:19,424 INFO L287 TraceCheckSpWp]: Computing forward predicates...
[2020-07-10 15:29:19,494 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-10 15:29:19,508 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts
[2020-07-10 15:29:19,539 INFO L263 TraceCheckUtils]: 0: Hoare triple {367#true} call ULTIMATE.init(); {367#true} is VALID
[2020-07-10 15:29:19,540 INFO L280 TraceCheckUtils]: 1: Hoare triple {367#true} ~__return_main~0 := 0;~__return_144~0 := 0; {367#true} is VALID
[2020-07-10 15:29:19,540 INFO L280 TraceCheckUtils]: 2: Hoare triple {367#true} assume true; {367#true} is VALID
[2020-07-10 15:29:19,541 INFO L275 TraceCheckUtils]: 3: Hoare quadruple {367#true} {367#true} #36#return; {367#true} is VALID
[2020-07-10 15:29:19,541 INFO L263 TraceCheckUtils]: 4: Hoare triple {367#true} call #t~ret1 := main(); {367#true} is VALID
[2020-07-10 15:29:19,541 INFO L280 TraceCheckUtils]: 5: Hoare triple {367#true} havoc ~main__x~0;havoc ~main__y~0;~main__x~0 := -50;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~main__y~0 := #t~nondet0;havoc #t~nondet0; {367#true} is VALID
[2020-07-10 15:29:19,542 INFO L280 TraceCheckUtils]: 6: Hoare triple {367#true} assume !!(-1000 < ~main__y~0); {367#true} is VALID
[2020-07-10 15:29:19,542 INFO L280 TraceCheckUtils]: 7: Hoare triple {367#true} assume !!(~main__y~0 < 1000000); {367#true} is VALID
[2020-07-10 15:29:19,542 INFO L280 TraceCheckUtils]: 8: Hoare triple {367#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {367#true} is VALID
[2020-07-10 15:29:19,543 INFO L280 TraceCheckUtils]: 9: Hoare triple {367#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {367#true} is VALID
[2020-07-10 15:29:19,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {367#true} assume ~main__x~0 < 0;~main__x~0 := ~main__x~0 + ~main__y~0;~main____CPAchecker_TMP_0~0 := ~main__y~0;~main__y~0 := 1 + ~main__y~0; {411#(<= (+ main_~main__x~0 2) main_~main__y~0)} is VALID
[2020-07-10 15:29:19,546 INFO L280 TraceCheckUtils]: 11: Hoare triple {411#(<= (+ main_~main__x~0 2) main_~main__y~0)} assume !(~main__x~0 < 0);havoc ~__tmp_1~0;~__tmp_1~0 := (if ~main__y~0 > 0 then 1 else 0);havoc ~__VERIFIER_assert__cond~0;~__VERIFIER_assert__cond~0 := ~__tmp_1~0; {415#(<= 1 main_~__VERIFIER_assert__cond~0)} is VALID
[2020-07-10 15:29:19,546 INFO L280 TraceCheckUtils]: 12: Hoare triple {415#(<= 1 main_~__VERIFIER_assert__cond~0)} assume 0 == ~__VERIFIER_assert__cond~0; {368#false} is VALID
[2020-07-10 15:29:19,547 INFO L280 TraceCheckUtils]: 13: Hoare triple {368#false} assume !false; {368#false} is VALID
[2020-07-10 15:29:19,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2020-07-10 15:29:19,548 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences.
[2020-07-10 15:29:19,548 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10
[2020-07-10 15:29:19,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903489915]
[2020-07-10 15:29:19,549 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-07-10 15:29:19,549 INFO L84 Accepts]: Finished accepts. word is accepted.
[2020-07-10 15:29:19,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states.
[2020-07-10 15:29:19,567 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:29:19,568 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states
[2020-07-10 15:29:19,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2020-07-10 15:29:19,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2020-07-10 15:29:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90
[2020-07-10 15:29:19,569 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 4 states.
[2020-07-10 15:29:19,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:19,637 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions.
[2020-07-10 15:29:19,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2020-07-10 15:29:19,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14
[2020-07-10 15:29:19,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2020-07-10 15:29:19,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-10 15:29:19,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions.
[2020-07-10 15:29:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states.
[2020-07-10 15:29:19,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 13 transitions.
[2020-07-10 15:29:19,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 13 transitions.
[2020-07-10 15:29:19,663 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity.
[2020-07-10 15:29:19,663 INFO L225 Difference]: With dead ends: 15
[2020-07-10 15:29:19,663 INFO L226 Difference]: Without dead ends: 0
[2020-07-10 15:29:19,664 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110
[2020-07-10 15:29:19,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2020-07-10 15:29:19,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2020-07-10 15:29:19,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa
[2020-07-10 15:29:19,666 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states.
[2020-07-10 15:29:19,666 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-10 15:29:19,666 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-10 15:29:19,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:19,666 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-10 15:29:19,666 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-10 15:29:19,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:19,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:19,667 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states.
[2020-07-10 15:29:19,667 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states.
[2020-07-10 15:29:19,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2020-07-10 15:29:19,667 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions.
[2020-07-10 15:29:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-10 15:29:19,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:19,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included
[2020-07-10 15:29:19,668 INFO L88 GeneralOperation]: Finished isEquivalent.
[2020-07-10 15:29:19,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa
[2020-07-10 15:29:19,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2020-07-10 15:29:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2020-07-10 15:29:19,668 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14
[2020-07-10 15:29:19,668 INFO L84 Accepts]: Finished accepts. word is rejected.
[2020-07-10 15:29:19,669 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2020-07-10 15:29:19,669 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2020-07-10 15:29:19,669 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2020-07-10 15:29:19,669 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2020-07-10 15:29:19,869 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2020-07-10 15:29:19,875 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2020-07-10 15:29:19,948 INFO L268 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed.
[2020-07-10 15:29:19,949 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__return_144~0 |old(~__return_144~0)|))
[2020-07-10 15:29:19,949 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2020-07-10 15:29:19,949 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2020-07-10 15:29:19,949 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true
[2020-07-10 15:29:19,949 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2020-07-10 15:29:19,949 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2020-07-10 15:29:19,950 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 4 6) no Hoare annotation was computed.
[2020-07-10 15:29:19,950 INFO L268 CegarLoopResult]: For program point L5(line 5) no Hoare annotation was computed.
[2020-07-10 15:29:19,951 INFO L268 CegarLoopResult]: For program point L5-2(lines 4 6) no Hoare annotation was computed.
[2020-07-10 15:29:19,951 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 4 6) no Hoare annotation was computed.
[2020-07-10 15:29:19,951 INFO L268 CegarLoopResult]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 46) no Hoare annotation was computed.
[2020-07-10 15:29:19,951 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 11 58) the Hoare annotation is: (= |old(~__return_144~0)| ~__return_144~0)
[2020-07-10 15:29:19,951 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 11 58) no Hoare annotation was computed.
[2020-07-10 15:29:19,952 INFO L268 CegarLoopResult]: For program point L23(lines 23 56) no Hoare annotation was computed.
[2020-07-10 15:29:19,952 INFO L268 CegarLoopResult]: For program point L17(lines 17 57) no Hoare annotation was computed.
[2020-07-10 15:29:19,952 INFO L268 CegarLoopResult]: For program point L46(line 46) no Hoare annotation was computed.
[2020-07-10 15:29:19,952 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 11 58) no Hoare annotation was computed.
[2020-07-10 15:29:19,952 INFO L268 CegarLoopResult]: For program point L44(lines 44 53) no Hoare annotation was computed.
[2020-07-10 15:29:19,952 INFO L264 CegarLoopResult]: At program point L35(lines 28 56) the Hoare annotation is: (let ((.cse0 (= |old(~__return_144~0)| ~__return_144~0))) (or (and (<= (+ main_~main__x~0 50) 0) .cse0) (and (<= (+ main_~main__x~0 2) main_~main__y~0) .cse0)))
[2020-07-10 15:29:19,958 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2020-07-10 15:29:19,959 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation
[2020-07-10 15:29:19,959 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2020-07-10 15:29:19,959 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation
[2020-07-10 15:29:19,960 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-10 15:29:19,960 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation
[2020-07-10 15:29:19,961 WARN L170 areAnnotationChecker]: L5 has no Hoare annotation
[2020-07-10 15:29:19,961 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2020-07-10 15:29:19,961 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation
[2020-07-10 15:29:19,961 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation
[2020-07-10 15:29:19,961 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation
[2020-07-10 15:29:19,961 WARN L170 areAnnotationChecker]: L5-2 has no Hoare annotation
[2020-07-10 15:29:19,961 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation
[2020-07-10 15:29:19,962 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 15:29:19,962 WARN L170 areAnnotationChecker]: L23 has no Hoare annotation
[2020-07-10 15:29:19,962 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation
[2020-07-10 15:29:19,964 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation
[2020-07-10 15:29:19,964 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation
[2020-07-10 15:29:19,964 WARN L170 areAnnotationChecker]: L44 has no Hoare annotation
[2020-07-10 15:29:19,964 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation
[2020-07-10 15:29:19,964 WARN L170 areAnnotationChecker]: L46 has no Hoare annotation
[2020-07-10 15:29:19,964 INFO L163 areAnnotationChecker]: CFG has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing.
[2020-07-10 15:29:19,982 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.07 03:29:19 BoogieIcfgContainer
[2020-07-10 15:29:19,983 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2020-07-10 15:29:19,988 INFO L168 Benchmark]: Toolchain (without parser) took 4596.59 ms. Allocated memory was 143.1 MB in the beginning and 250.6 MB in the end (delta: 107.5 MB). Free memory was 99.4 MB in the beginning and 139.8 MB in the end (delta: -40.4 MB). Peak memory consumption was 67.1 MB. Max. memory is 7.1 GB.
[2020-07-10 15:29:19,989 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 143.1 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2020-07-10 15:29:19,991 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.56 ms. Allocated memory is still 143.1 MB. Free memory was 99.2 MB in the beginning and 89.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB.
[2020-07-10 15:29:19,999 INFO L168 Benchmark]: Boogie Preprocessor took 32.16 ms. Allocated memory is still 143.1 MB. Free memory was 89.4 MB in the beginning and 88.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB.
[2020-07-10 15:29:20,006 INFO L168 Benchmark]: RCFGBuilder took 456.54 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 87.8 MB in the beginning and 164.0 MB in the end (delta: -76.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB.
[2020-07-10 15:29:20,007 INFO L168 Benchmark]: TraceAbstraction took 3795.38 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 164.0 MB in the beginning and 139.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 74.5 MB. Max. memory is 7.1 GB.
[2020-07-10 15:29:20,013 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.24 ms. Allocated memory is still 143.1 MB. Free memory was 118.1 MB in the beginning and 117.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 305.56 ms. Allocated memory is still 143.1 MB. Free memory was 99.2 MB in the beginning and 89.4 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 32.16 ms. Allocated memory is still 143.1 MB. Free memory was 89.4 MB in the beginning and 88.0 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 456.54 ms. Allocated memory was 143.1 MB in the beginning and 200.3 MB in the end (delta: 57.1 MB). Free memory was 87.8 MB in the beginning and 164.0 MB in the end (delta: -76.2 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 3795.38 ms. Allocated memory was 200.3 MB in the beginning and 250.6 MB in the end (delta: 50.3 MB). Free memory was 164.0 MB in the beginning and 139.8 MB in the end (delta: 24.2 MB). Peak memory consumption was 74.5 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 46]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- InvariantResult [Line: 28]: Loop Invariant
Derived loop invariant: (main__x + 50 <= 0 && \old(__return_144) == __return_144) || (main__x + 2 <= main__y && \old(__return_144) == __return_144)
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 4 procedures, 20 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 3.5s, OverallIterations: 4, TraceHistogramMax: 3, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 44 SDtfs, 32 SDslu, 69 SDs, 0 SdLazy, 87 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 8 NumberOfFragments, 31 HoareAnnotationTreeSize, 5 FomulaSimplifications, 36 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 89 NumberOfCodeBlocks, 88 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 82 ConstructedInterpolants, 0 QuantifiedInterpolants, 2840 SizeOfPredicates, 12 NumberOfNonLiveVariables, 149 ConjunctsInSsa, 23 ConjunctsInUnsatCore, 7 InterpolantComputations, 2 PerfectInterpolantSequences, 6/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...