java -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 --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/reducercommutativity/sum60-2.i


--------------------------------------------------------------------------------


This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 21:23:28,802 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2019-10-13 21:23:28,805 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 21:23:28,816 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 21:23:28,817 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 21:23:28,818 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 21:23:28,819 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 21:23:28,821 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 21:23:28,823 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 21:23:28,824 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 21:23:28,825 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 21:23:28,826 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 21:23:28,826 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 21:23:28,827 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 21:23:28,828 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 21:23:28,829 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 21:23:28,830 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 21:23:28,831 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 21:23:28,835 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 21:23:28,837 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 21:23:28,839 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 21:23:28,844 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 21:23:28,846 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 21:23:28,847 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 21:23:28,849 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 21:23:28,850 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 21:23:28,850 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 21:23:28,853 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 21:23:28,854 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 21:23:28,856 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 21:23:28,857 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 21:23:28,858 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 21:23:28,859 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 21:23:28,860 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 21:23:28,864 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 21:23:28,864 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 21:23:28,865 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 21:23:28,865 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 21:23:28,865 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 21:23:28,867 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 21:23:28,871 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 21:23:28,872 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
[2019-10-13 21:23:28,893 INFO  L113        SettingsManager]: Loading preferences was successful
[2019-10-13 21:23:28,893 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 21:23:28,897 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 21:23:28,897 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2019-10-13 21:23:28,898 INFO  L138        SettingsManager]:  * Use SBE=true
[2019-10-13 21:23:28,898 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 21:23:28,898 INFO  L138        SettingsManager]:  * sizeof long=4
[2019-10-13 21:23:28,899 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2019-10-13 21:23:28,899 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2019-10-13 21:23:28,899 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2019-10-13 21:23:28,900 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 21:23:28,900 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 21:23:28,900 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 21:23:28,901 INFO  L138        SettingsManager]:  * sizeof long double=12
[2019-10-13 21:23:28,901 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2019-10-13 21:23:28,901 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2019-10-13 21:23:28,901 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2019-10-13 21:23:28,902 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 21:23:28,902 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2019-10-13 21:23:28,903 INFO  L138        SettingsManager]:  * To the following directory=./dump/
[2019-10-13 21:23:28,903 INFO  L138        SettingsManager]:  * SMT solver=External_DefaultMode
[2019-10-13 21:23:28,905 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 21:23:28,905 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 21:23:28,906 INFO  L138        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 21:23:28,907 INFO  L138        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 21:23:28,907 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2019-10-13 21:23:28,907 INFO  L138        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 21:23:28,907 INFO  L138        SettingsManager]:  * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 21:23:28,907 INFO  L138        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES
[2019-10-13 21:23:29,192 INFO  L81    nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 21:23:29,205 INFO  L258   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 21:23:29,208 INFO  L214   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 21:23:29,210 INFO  L271        PluginConnector]: Initializing CDTParser...
[2019-10-13 21:23:29,210 INFO  L275        PluginConnector]: CDTParser initialized
[2019-10-13 21:23:29,211 INFO  L428   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/reducercommutativity/sum60-2.i
[2019-10-13 21:23:29,274 INFO  L220              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219d53deb/902c45ad31064e23900cba28024b19d0/FLAG724fec38b
[2019-10-13 21:23:29,787 INFO  L306              CDTParser]: Found 1 translation units.
[2019-10-13 21:23:29,789 INFO  L160              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/reducercommutativity/sum60-2.i
[2019-10-13 21:23:29,795 INFO  L349              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219d53deb/902c45ad31064e23900cba28024b19d0/FLAG724fec38b
[2019-10-13 21:23:30,110 INFO  L357              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/219d53deb/902c45ad31064e23900cba28024b19d0
[2019-10-13 21:23:30,119 INFO  L296   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 21:23:30,121 INFO  L131        ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 21:23:30,122 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 21:23:30,122 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 21:23:30,126 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 21:23:30,127 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,130 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e9a2ffc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30, skipping insertion in model container
[2019-10-13 21:23:30,130 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,138 INFO  L142         MainTranslator]: Starting translation in SV-COMP mode 
[2019-10-13 21:23:30,160 INFO  L173         MainTranslator]: Built tables and reachable declarations
[2019-10-13 21:23:30,360 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:23:30,371 INFO  L188         MainTranslator]: Completed pre-run
[2019-10-13 21:23:30,395 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2019-10-13 21:23:30,410 INFO  L192         MainTranslator]: Completed translation
[2019-10-13 21:23:30,411 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30 WrapperNode
[2019-10-13 21:23:30,411 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 21:23:30,412 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 21:23:30,412 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 21:23:30,412 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 21:23:30,500 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,500 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,508 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,508 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,515 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,528 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,529 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (1/1) ...
[2019-10-13 21:23:30,532 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 21:23:30,533 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 21:23:30,533 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 21:23:30,533 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2019-10-13 21:23:30,534 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (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
[2019-10-13 21:23:30,587 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 21:23:30,587 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 21:23:30,588 INFO  L138     BoogieDeclarations]: Found implementation of procedure sum
[2019-10-13 21:23:30,588 INFO  L138     BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 21:23:30,588 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 21:23:30,588 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 21:23:30,588 INFO  L130     BoogieDeclarations]: Found specification of procedure sum
[2019-10-13 21:23:30,588 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int
[2019-10-13 21:23:30,588 INFO  L130     BoogieDeclarations]: Found specification of procedure main
[2019-10-13 21:23:30,589 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2019-10-13 21:23:30,589 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int
[2019-10-13 21:23:30,589 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-10-13 21:23:30,589 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 21:23:30,589 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 21:23:30,900 INFO  L279             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 21:23:30,900 INFO  L284             CfgBuilder]: Removed 3 assume(true) statements.
[2019-10-13 21:23:30,901 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:30 BoogieIcfgContainer
[2019-10-13 21:23:30,902 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 21:23:30,903 INFO  L113        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 21:23:30,903 INFO  L271        PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 21:23:30,906 INFO  L275        PluginConnector]: TraceAbstraction initialized
[2019-10-13 21:23:30,907 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:23:30" (1/3) ...
[2019-10-13 21:23:30,908 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0ee746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:30, skipping insertion in model container
[2019-10-13 21:23:30,908 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:23:30" (2/3) ...
[2019-10-13 21:23:30,908 INFO  L205        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e0ee746 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:23:30, skipping insertion in model container
[2019-10-13 21:23:30,908 INFO  L185        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:23:30" (3/3) ...
[2019-10-13 21:23:30,910 INFO  L109   eAbstractionObserver]: Analyzing ICFG sum60-2.i
[2019-10-13 21:23:30,918 INFO  L152   ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 21:23:30,925 INFO  L164   ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations.
[2019-10-13 21:23:30,933 INFO  L249      AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2019-10-13 21:23:30,957 INFO  L373      AbstractCegarLoop]: Interprodecural is true
[2019-10-13 21:23:30,957 INFO  L374      AbstractCegarLoop]: Hoare is true
[2019-10-13 21:23:30,957 INFO  L375      AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 21:23:30,957 INFO  L376      AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 21:23:30,957 INFO  L377      AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 21:23:30,958 INFO  L378      AbstractCegarLoop]: Difference is false
[2019-10-13 21:23:30,958 INFO  L379      AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 21:23:30,958 INFO  L383      AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 21:23:30,974 INFO  L276                IsEmpty]: Start isEmpty. Operand 31 states.
[2019-10-13 21:23:30,981 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2019-10-13 21:23:30,981 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:23:30,982 INFO  L380         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:30,984 INFO  L410      AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:30,988 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:30,989 INFO  L82        PathProgramCache]: Analyzing trace with hash -1461178031, now seen corresponding path program 1 times
[2019-10-13 21:23:30,996 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:30,996 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896426628]
[2019-10-13 21:23:30,996 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:30,996 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:30,997 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:31,088 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:31,151 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2019-10-13 21:23:31,152 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896426628]
[2019-10-13 21:23:31,153 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:31,153 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-10-13 21:23:31,154 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888684761]
[2019-10-13 21:23:31,158 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-10-13 21:23:31,160 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:31,175 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-10-13 21:23:31,177 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:23:31,179 INFO  L87              Difference]: Start difference. First operand 31 states. Second operand 2 states.
[2019-10-13 21:23:31,207 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:31,208 INFO  L93              Difference]: Finished difference Result 54 states and 71 transitions.
[2019-10-13 21:23:31,208 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2019-10-13 21:23:31,209 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 32
[2019-10-13 21:23:31,210 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:31,219 INFO  L225             Difference]: With dead ends: 54
[2019-10-13 21:23:31,220 INFO  L226             Difference]: Without dead ends: 26
[2019-10-13 21:23:31,224 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:23:31,246 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 26 states.
[2019-10-13 21:23:31,269 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26.
[2019-10-13 21:23:31,272 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 26 states.
[2019-10-13 21:23:31,273 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions.
[2019-10-13 21:23:31,275 INFO  L78                 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 32
[2019-10-13 21:23:31,276 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:31,276 INFO  L462      AbstractCegarLoop]: Abstraction has 26 states and 30 transitions.
[2019-10-13 21:23:31,276 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-10-13 21:23:31,277 INFO  L276                IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions.
[2019-10-13 21:23:31,279 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2019-10-13 21:23:31,279 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:23:31,280 INFO  L380         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:31,280 INFO  L410      AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:31,280 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:31,281 INFO  L82        PathProgramCache]: Analyzing trace with hash -595992629, now seen corresponding path program 1 times
[2019-10-13 21:23:31,281 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:31,282 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [280668977]
[2019-10-13 21:23:31,282 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:31,282 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:31,283 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:31,301 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:31,367 INFO  L134       CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked.
[2019-10-13 21:23:31,367 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [280668977]
[2019-10-13 21:23:31,368 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:31,368 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:31,368 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116701761]
[2019-10-13 21:23:31,370 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:31,371 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:31,371 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:31,371 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:31,372 INFO  L87              Difference]: Start difference. First operand 26 states and 30 transitions. Second operand 3 states.
[2019-10-13 21:23:31,411 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:31,411 INFO  L93              Difference]: Finished difference Result 46 states and 54 transitions.
[2019-10-13 21:23:31,412 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:23:31,412 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 32
[2019-10-13 21:23:31,412 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:31,413 INFO  L225             Difference]: With dead ends: 46
[2019-10-13 21:23:31,413 INFO  L226             Difference]: Without dead ends: 28
[2019-10-13 21:23:31,414 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:31,415 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 28 states.
[2019-10-13 21:23:31,427 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27.
[2019-10-13 21:23:31,428 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 27 states.
[2019-10-13 21:23:31,429 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions.
[2019-10-13 21:23:31,432 INFO  L78                 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 32
[2019-10-13 21:23:31,432 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:31,432 INFO  L462      AbstractCegarLoop]: Abstraction has 27 states and 31 transitions.
[2019-10-13 21:23:31,432 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:31,432 INFO  L276                IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions.
[2019-10-13 21:23:31,434 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 35
[2019-10-13 21:23:31,434 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:23:31,437 INFO  L380         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:31,438 INFO  L410      AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:31,438 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:31,438 INFO  L82        PathProgramCache]: Analyzing trace with hash 169606189, now seen corresponding path program 1 times
[2019-10-13 21:23:31,439 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:31,439 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846987117]
[2019-10-13 21:23:31,439 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:31,439 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:31,439 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:31,484 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:31,519 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2019-10-13 21:23:31,519 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846987117]
[2019-10-13 21:23:31,520 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088204850]
[2019-10-13 21:23:31,520 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
[2019-10-13 21:23:31,600 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:31,604 INFO  L256         TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 2 conjunts are in the unsatisfiable core
[2019-10-13 21:23:31,616 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:23:31,646 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked.
[2019-10-13 21:23:31,646 INFO  L321         TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:23:31,689 INFO  L134       CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2019-10-13 21:23:31,690 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences.
[2019-10-13 21:23:31,693 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5
[2019-10-13 21:23:31,694 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063828845]
[2019-10-13 21:23:31,694 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:31,695 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:31,695 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:31,695 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:23:31,696 INFO  L87              Difference]: Start difference. First operand 27 states and 31 transitions. Second operand 3 states.
[2019-10-13 21:23:31,717 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:31,718 INFO  L93              Difference]: Finished difference Result 46 states and 56 transitions.
[2019-10-13 21:23:31,719 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:23:31,719 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 34
[2019-10-13 21:23:31,720 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:31,720 INFO  L225             Difference]: With dead ends: 46
[2019-10-13 21:23:31,721 INFO  L226             Difference]: Without dead ends: 29
[2019-10-13 21:23:31,721 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20
[2019-10-13 21:23:31,722 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 29 states.
[2019-10-13 21:23:31,733 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28.
[2019-10-13 21:23:31,733 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 28 states.
[2019-10-13 21:23:31,736 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions.
[2019-10-13 21:23:31,736 INFO  L78                 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 34
[2019-10-13 21:23:31,736 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:31,736 INFO  L462      AbstractCegarLoop]: Abstraction has 28 states and 32 transitions.
[2019-10-13 21:23:31,737 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:31,737 INFO  L276                IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions.
[2019-10-13 21:23:31,739 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 41
[2019-10-13 21:23:31,740 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:23:31,741 INFO  L380         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:31,942 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:31,943 INFO  L410      AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:31,943 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:31,943 INFO  L82        PathProgramCache]: Analyzing trace with hash -1462689141, now seen corresponding path program 1 times
[2019-10-13 21:23:31,944 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:31,945 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528385526]
[2019-10-13 21:23:31,945 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:31,946 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:31,946 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:32,011 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:32,061 INFO  L134       CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2019-10-13 21:23:32,062 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528385526]
[2019-10-13 21:23:32,062 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 21:23:32,063 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 21:23:32,063 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581611169]
[2019-10-13 21:23:32,064 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 21:23:32,065 INFO  L137   tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:32,065 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 21:23:32,065 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:32,066 INFO  L87              Difference]: Start difference. First operand 28 states and 32 transitions. Second operand 3 states.
[2019-10-13 21:23:32,088 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:32,089 INFO  L93              Difference]: Finished difference Result 43 states and 48 transitions.
[2019-10-13 21:23:32,089 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. 
[2019-10-13 21:23:32,089 INFO  L78                 Accepts]: Start accepts. Automaton has 3 states. Word has length 40
[2019-10-13 21:23:32,090 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:32,091 INFO  L225             Difference]: With dead ends: 43
[2019-10-13 21:23:32,091 INFO  L226             Difference]: Without dead ends: 30
[2019-10-13 21:23:32,092 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 21:23:32,092 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2019-10-13 21:23:32,096 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29.
[2019-10-13 21:23:32,097 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 29 states.
[2019-10-13 21:23:32,098 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions.
[2019-10-13 21:23:32,098 INFO  L78                 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 40
[2019-10-13 21:23:32,100 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:32,100 INFO  L462      AbstractCegarLoop]: Abstraction has 29 states and 33 transitions.
[2019-10-13 21:23:32,100 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 21:23:32,101 INFO  L276                IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions.
[2019-10-13 21:23:32,102 INFO  L282                IsEmpty]: Finished isEmpty. Found accepting run of length 43
[2019-10-13 21:23:32,102 INFO  L372         BasicCegarLoop]: Found error trace
[2019-10-13 21:23:32,102 INFO  L380         BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 21:23:32,103 INFO  L410      AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 21:23:32,103 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:32,103 INFO  L82        PathProgramCache]: Analyzing trace with hash -233991671, now seen corresponding path program 1 times
[2019-10-13 21:23:32,103 INFO  L157   tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 21:23:32,104 INFO  L342   tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850717403]
[2019-10-13 21:23:32,104 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:32,104 INFO  L116   rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 21:23:32,104 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 21:23:32,138 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:32,212 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2019-10-13 21:23:32,212 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850717403]
[2019-10-13 21:23:32,213 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491299376]
[2019-10-13 21:23:32,213 INFO  L94    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
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
[2019-10-13 21:23:32,308 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 21:23:32,309 INFO  L256         TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 3 conjunts are in the unsatisfiable core
[2019-10-13 21:23:32,312 INFO  L279         TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 21:23:32,327 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2019-10-13 21:23:32,327 INFO  L321         TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 21:23:32,387 INFO  L134       CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked.
[2019-10-13 21:23:32,387 INFO  L342   tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [907184683]
[2019-10-13 21:23:32,396 INFO  L211      CegarAbsIntRunner]: Running AI on error trace of length 43
[2019-10-13 21:23:32,437 INFO  L148    AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 21:23:32,437 INFO  L101         FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 21:23:32,523 INFO  L266    AbstractInterpreter]: Error location(s) were unreachable
[2019-10-13 21:23:32,525 INFO  L272    AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 15 root evaluator evaluations with a maximum evaluation depth of 0. Performed 15 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 30 variables.
[2019-10-13 21:23:32,528 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 21:23:32,529 INFO  L536   sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-13 21:23:32,610 INFO  L227   lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes.
[2019-10-13 21:23:32,610 INFO  L551   sIntCurrentIteration]: Unifying AI predicates
[2019-10-13 21:23:32,615 INFO  L553   sIntCurrentIteration]: We unified 41 AI predicates to 41
[2019-10-13 21:23:32,617 INFO  L562   sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-13 21:23:32,617 INFO  L223   tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences.
[2019-10-13 21:23:32,618 INFO  L236   tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4, 4, 4] total 7
[2019-10-13 21:23:32,618 INFO  L342   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230760008]
[2019-10-13 21:23:32,619 INFO  L442      AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-10-13 21:23:32,620 INFO  L137   tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN
[2019-10-13 21:23:32,620 INFO  L124   tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy
[2019-10-13 21:23:32,620 INFO  L142   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-10-13 21:23:32,621 INFO  L144   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:23:32,621 INFO  L87              Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 2 states.
[2019-10-13 21:23:32,625 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 21:23:32,626 INFO  L93              Difference]: Finished difference Result 29 states and 33 transitions.
[2019-10-13 21:23:32,627 INFO  L142   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2019-10-13 21:23:32,627 INFO  L78                 Accepts]: Start accepts. Automaton has 2 states. Word has length 42
[2019-10-13 21:23:32,627 INFO  L84                 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 21:23:32,628 INFO  L225             Difference]: With dead ends: 29
[2019-10-13 21:23:32,628 INFO  L226             Difference]: Without dead ends: 0
[2019-10-13 21:23:32,629 INFO  L600         BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 21:23:32,629 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 21:23:32,629 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 21:23:32,630 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 21:23:32,630 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 21:23:32,634 INFO  L78                 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42
[2019-10-13 21:23:32,634 INFO  L84                 Accepts]: Finished accepts. word is rejected.
[2019-10-13 21:23:32,635 INFO  L462      AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 21:23:32,635 INFO  L463      AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-10-13 21:23:32,635 INFO  L276                IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 21:23:32,637 INFO  L282                IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 21:23:32,840 WARN  L499      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 21:23:32,845 INFO  L343    DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 21:23:32,881 INFO  L443   ceAbstractionStarter]: For program point  ULTIMATE.initFINAL(line -1)  no Hoare annotation was computed.
[2019-10-13 21:23:32,881 INFO  L446   ceAbstractionStarter]: At program point  ULTIMATE.initENTRY(line -1)  the Hoare annotation is:  true
[2019-10-13 21:23:32,881 INFO  L443   ceAbstractionStarter]: For program point  ULTIMATE.initEXIT(line -1)  no Hoare annotation was computed.
[2019-10-13 21:23:32,881 INFO  L443   ceAbstractionStarter]: For program point  ULTIMATE.startEXIT(line -1)  no Hoare annotation was computed.
[2019-10-13 21:23:32,881 INFO  L446   ceAbstractionStarter]: At program point  L-1(line -1)  the Hoare annotation is:  true
[2019-10-13 21:23:32,882 INFO  L446   ceAbstractionStarter]: At program point  ULTIMATE.startENTRY(line -1)  the Hoare annotation is:  true
[2019-10-13 21:23:32,882 INFO  L443   ceAbstractionStarter]: For program point  ULTIMATE.startFINAL(line -1)  no Hoare annotation was computed.
[2019-10-13 21:23:32,882 INFO  L443   ceAbstractionStarter]: For program point  sumEXIT(lines 4 13)  no Hoare annotation was computed.
[2019-10-13 21:23:32,882 INFO  L446   ceAbstractionStarter]: At program point  sumENTRY(lines 4 13)  the Hoare annotation is:  true
[2019-10-13 21:23:32,882 INFO  L443   ceAbstractionStarter]: For program point  L9-2(lines 9 11)  no Hoare annotation was computed.
[2019-10-13 21:23:32,882 INFO  L446   ceAbstractionStarter]: At program point  L9-3(lines 9 11)  the Hoare annotation is:  true
[2019-10-13 21:23:32,882 INFO  L443   ceAbstractionStarter]: For program point  L9-4(lines 9 11)  no Hoare annotation was computed.
[2019-10-13 21:23:32,882 INFO  L443   ceAbstractionStarter]: For program point  sumFINAL(lines 4 13)  no Hoare annotation was computed.
[2019-10-13 21:23:32,883 INFO  L443   ceAbstractionStarter]: For program point  L27(line 27)  no Hoare annotation was computed.
[2019-10-13 21:23:32,883 INFO  L443   ceAbstractionStarter]: For program point  mainEXIT(lines 15 42)  no Hoare annotation was computed.
[2019-10-13 21:23:32,883 INFO  L443   ceAbstractionStarter]: For program point  L23-2(lines 23 25)  no Hoare annotation was computed.
[2019-10-13 21:23:32,883 INFO  L439   ceAbstractionStarter]: At program point  L23-3(lines 23 25)  the Hoare annotation is:  false
[2019-10-13 21:23:32,883 INFO  L439   ceAbstractionStarter]: At program point  L23-4(lines 23 25)  the Hoare annotation is:  false
[2019-10-13 21:23:32,883 INFO  L443   ceAbstractionStarter]: For program point  mainFINAL(lines 15 42)  no Hoare annotation was computed.
[2019-10-13 21:23:32,883 INFO  L443   ceAbstractionStarter]: For program point  L38(lines 38 40)  no Hoare annotation was computed.
[2019-10-13 21:23:32,884 INFO  L439   ceAbstractionStarter]: At program point  L36(line 36)  the Hoare annotation is:  false
[2019-10-13 21:23:32,884 INFO  L443   ceAbstractionStarter]: For program point  L38-2(lines 38 40)  no Hoare annotation was computed.
[2019-10-13 21:23:32,884 INFO  L443   ceAbstractionStarter]: For program point  L36-1(line 36)  no Hoare annotation was computed.
[2019-10-13 21:23:32,884 INFO  L439   ceAbstractionStarter]: At program point  L30(line 30)  the Hoare annotation is:  false
[2019-10-13 21:23:32,892 INFO  L443   ceAbstractionStarter]: For program point  L32-2(lines 32 34)  no Hoare annotation was computed.
[2019-10-13 21:23:32,892 INFO  L446   ceAbstractionStarter]: At program point  mainENTRY(lines 15 42)  the Hoare annotation is:  true
[2019-10-13 21:23:32,892 INFO  L443   ceAbstractionStarter]: For program point  L30-1(line 30)  no Hoare annotation was computed.
[2019-10-13 21:23:32,893 INFO  L439   ceAbstractionStarter]: At program point  L32-3(lines 32 34)  the Hoare annotation is:  false
[2019-10-13 21:23:32,893 INFO  L443   ceAbstractionStarter]: For program point  L32-4(lines 32 34)  no Hoare annotation was computed.
[2019-10-13 21:23:32,893 INFO  L443   ceAbstractionStarter]: For program point  L39(line 39)  no Hoare annotation was computed.
[2019-10-13 21:23:32,893 INFO  L443   ceAbstractionStarter]: For program point  mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 39)  no Hoare annotation was computed.
[2019-10-13 21:23:32,901 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 09:23:32 BoogieIcfgContainer
[2019-10-13 21:23:32,902 INFO  L132        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 21:23:32,904 INFO  L168              Benchmark]: Toolchain (without parser) took 2782.64 ms. Allocated memory was 137.4 MB in the beginning and 232.3 MB in the end (delta: 94.9 MB). Free memory was 101.8 MB in the beginning and 170.1 MB in the end (delta: -68.2 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:32,907 INFO  L168              Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 21:23:32,910 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 289.38 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 91.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:32,917 INFO  L168              Benchmark]: Boogie Preprocessor took 120.40 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.3 MB in the beginning and 178.9 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:32,918 INFO  L168              Benchmark]: RCFGBuilder took 369.34 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 163.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:32,920 INFO  L168              Benchmark]: TraceAbstraction took 1998.62 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 162.6 MB in the beginning and 170.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB.
[2019-10-13 21:23:32,932 INFO  L335   ainManager$Toolchain]: #######################  End [Toolchain 1] #######################
 --- Results ---
 * Results from de.uni_freiburg.informatik.ultimate.core:
  - StatisticsResult: Toolchain Benchmarks
    Benchmark results are:
 * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 120.6 MB in the beginning and 120.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
 * CACSL2BoogieTranslator took 289.38 ms. Allocated memory is still 137.4 MB. Free memory was 101.6 MB in the beginning and 91.3 MB in the end (delta: 10.3 MB). Peak memory consumption was 10.3 MB. Max. memory is 7.1 GB.
 * Boogie Preprocessor took 120.40 ms. Allocated memory was 137.4 MB in the beginning and 201.3 MB in the end (delta: 64.0 MB). Free memory was 91.3 MB in the beginning and 178.9 MB in the end (delta: -87.5 MB). Peak memory consumption was 14.0 MB. Max. memory is 7.1 GB.
 * RCFGBuilder took 369.34 ms. Allocated memory is still 201.3 MB. Free memory was 178.9 MB in the beginning and 163.3 MB in the end (delta: 15.6 MB). Peak memory consumption was 15.6 MB. Max. memory is 7.1 GB.
 * TraceAbstraction took 1998.62 ms. Allocated memory was 201.3 MB in the beginning and 232.3 MB in the end (delta: 30.9 MB). Free memory was 162.6 MB in the beginning and 170.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 23.5 MB. Max. memory is 7.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - PositiveResult [Line: 39]: 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: 9]: Loop Invariant
    Derived loop invariant: 1
  - InvariantResult [Line: 32]: Loop Invariant
    Derived loop invariant: 0
  - InvariantResult [Line: 23]: Loop Invariant
    Derived loop invariant: 0
  - StatisticsResult: Ultimate Automizer benchmark data
    CFG has 4 procedures, 31 locations, 1 error locations. Result: SAFE, OverallTime: 1.9s, OverallIterations: 5, TraceHistogramMax: 3, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 124 SDtfs, 3 SDslu, 78 SDs, 0 SdLazy, 15 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 119 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 3 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 33 PreInvPairs, 33 NumberOfFragments, 11 HoareAnnotationTreeSize, 33 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 256 NumberOfCodeBlocks, 256 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 323 ConstructedInterpolants, 0 QuantifiedInterpolants, 12829 SizeOfPredicates, 2 NumberOfNonLiveVariables, 273 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 9 InterpolantComputations, 4 PerfectInterpolantSequences, 186/205 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 134, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9573170731707317, AVG_VARS_REMOVED_DURING_WEAKENING: 1.2439024390243902, AVG_WEAKENED_CONJUNCTS: 0.14634146341463414, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...