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/forester-heap/dll-queue-1.i
--------------------------------------------------------------------------------
This is Ultimate 0.1.24-f4eb214f-m
[2019-10-13 20:11:56,824 INFO L177 SettingsManager]: Resetting all preferences to default values...
[2019-10-13 20:11:56,827 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values
[2019-10-13 20:11:56,843 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2019-10-13 20:11:56,843 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2019-10-13 20:11:56,844 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2019-10-13 20:11:56,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2019-10-13 20:11:56,848 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values
[2019-10-13 20:11:56,849 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values
[2019-10-13 20:11:56,850 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values
[2019-10-13 20:11:56,851 INFO L181 SettingsManager]: Resetting Sifa preferences to default values
[2019-10-13 20:11:56,852 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2019-10-13 20:11:56,853 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values
[2019-10-13 20:11:56,854 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values
[2019-10-13 20:11:56,855 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2019-10-13 20:11:56,856 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values
[2019-10-13 20:11:56,857 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2019-10-13 20:11:56,858 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2019-10-13 20:11:56,859 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2019-10-13 20:11:56,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values
[2019-10-13 20:11:56,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2019-10-13 20:11:56,864 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values
[2019-10-13 20:11:56,865 INFO L181 SettingsManager]: Resetting Referee preferences to default values
[2019-10-13 20:11:56,866 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values
[2019-10-13 20:11:56,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2019-10-13 20:11:56,869 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2019-10-13 20:11:56,869 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values
[2019-10-13 20:11:56,870 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values
[2019-10-13 20:11:56,871 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values
[2019-10-13 20:11:56,872 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring...
[2019-10-13 20:11:56,872 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values
[2019-10-13 20:11:56,873 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2019-10-13 20:11:56,873 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values
[2019-10-13 20:11:56,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values
[2019-10-13 20:11:56,877 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2019-10-13 20:11:56,878 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values
[2019-10-13 20:11:56,879 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2019-10-13 20:11:56,879 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring...
[2019-10-13 20:11:56,879 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values
[2019-10-13 20:11:56,880 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values
[2019-10-13 20:11:56,881 INFO L188 SettingsManager]: Finished resetting all preferences to default values...
[2019-10-13 20:11:56,884 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 20:11:56,907 INFO L113 SettingsManager]: Loading preferences was successful
[2019-10-13 20:11:56,907 INFO L115 SettingsManager]: Preferences different from defaults after loading the file:
[2019-10-13 20:11:56,909 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2019-10-13 20:11:56,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false
[2019-10-13 20:11:56,909 INFO L138 SettingsManager]: * Use SBE=true
[2019-10-13 20:11:56,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2019-10-13 20:11:56,910 INFO L138 SettingsManager]: * sizeof long=4
[2019-10-13 20:11:56,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true
[2019-10-13 20:11:56,910 INFO L138 SettingsManager]: * sizeof POINTER=4
[2019-10-13 20:11:56,910 INFO L138 SettingsManager]: * Check division by zero=IGNORE
[2019-10-13 20:11:56,910 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2019-10-13 20:11:56,911 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2019-10-13 20:11:56,911 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2019-10-13 20:11:56,911 INFO L138 SettingsManager]: * sizeof long double=12
[2019-10-13 20:11:56,911 INFO L138 SettingsManager]: * Check if freed pointer was valid=false
[2019-10-13 20:11:56,911 INFO L138 SettingsManager]: * Use constant arrays=true
[2019-10-13 20:11:56,912 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2019-10-13 20:11:56,912 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2019-10-13 20:11:56,912 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements
[2019-10-13 20:11:56,912 INFO L138 SettingsManager]: * To the following directory=./dump/
[2019-10-13 20:11:56,912 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode
[2019-10-13 20:11:56,913 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000
[2019-10-13 20:11:56,913 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2019-10-13 20:11:56,913 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2019-10-13 20:11:56,913 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles
[2019-10-13 20:11:56,913 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL
[2019-10-13 20:11:56,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2019-10-13 20:11:56,914 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true
[2019-10-13 20:11:56,914 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 20:11:57,223 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp
[2019-10-13 20:11:57,241 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2019-10-13 20:11:57,245 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2019-10-13 20:11:57,247 INFO L271 PluginConnector]: Initializing CDTParser...
[2019-10-13 20:11:57,247 INFO L275 PluginConnector]: CDTParser initialized
[2019-10-13 20:11:57,248 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue-1.i
[2019-10-13 20:11:57,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925baf457/b9377c6d662e4c27b8c760fefb058abd/FLAG4c6e7f206
[2019-10-13 20:11:57,879 INFO L306 CDTParser]: Found 1 translation units.
[2019-10-13 20:11:57,880 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-queue-1.i
[2019-10-13 20:11:57,894 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925baf457/b9377c6d662e4c27b8c760fefb058abd/FLAG4c6e7f206
[2019-10-13 20:11:58,152 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/925baf457/b9377c6d662e4c27b8c760fefb058abd
[2019-10-13 20:11:58,163 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2019-10-13 20:11:58,164 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements.
[2019-10-13 20:11:58,165 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2019-10-13 20:11:58,165 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2019-10-13 20:11:58,171 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized
[2019-10-13 20:11:58,172 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,175 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4772fc27 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58, skipping insertion in model container
[2019-10-13 20:11:58,175 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,182 INFO L142 MainTranslator]: Starting translation in SV-COMP mode
[2019-10-13 20:11:58,243 INFO L173 MainTranslator]: Built tables and reachable declarations
[2019-10-13 20:11:58,680 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 20:11:58,701 INFO L188 MainTranslator]: Completed pre-run
[2019-10-13 20:11:58,763 INFO L206 PostProcessor]: Analyzing one entry point: main
[2019-10-13 20:11:58,835 INFO L192 MainTranslator]: Completed translation
[2019-10-13 20:11:58,835 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58 WrapperNode
[2019-10-13 20:11:58,835 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2019-10-13 20:11:58,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2019-10-13 20:11:58,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor...
[2019-10-13 20:11:58,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized
[2019-10-13 20:11:58,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,893 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,893 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,926 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,935 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,939 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (1/1) ...
[2019-10-13 20:11:58,946 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2019-10-13 20:11:58,946 INFO L113 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2019-10-13 20:11:58,946 INFO L271 PluginConnector]: Initializing RCFGBuilder...
[2019-10-13 20:11:58,947 INFO L275 PluginConnector]: RCFGBuilder initialized
[2019-10-13 20:11:58,947 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (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 20:11:59,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init
[2019-10-13 20:11:59,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2019-10-13 20:11:59,011 INFO L138 BoogieDeclarations]: Found implementation of procedure main
[2019-10-13 20:11:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max
[2019-10-13 20:11:59,011 INFO L130 BoogieDeclarations]: Found specification of procedure atof
[2019-10-13 20:11:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure atoi
[2019-10-13 20:11:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure atol
[2019-10-13 20:11:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure atoll
[2019-10-13 20:11:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtod
[2019-10-13 20:11:59,012 INFO L130 BoogieDeclarations]: Found specification of procedure strtof
[2019-10-13 20:11:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtold
[2019-10-13 20:11:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtol
[2019-10-13 20:11:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul
[2019-10-13 20:11:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq
[2019-10-13 20:11:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq
[2019-10-13 20:11:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll
[2019-10-13 20:11:59,013 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull
[2019-10-13 20:11:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure l64a
[2019-10-13 20:11:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure a64l
[2019-10-13 20:11:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure select
[2019-10-13 20:11:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure pselect
[2019-10-13 20:11:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major
[2019-10-13 20:11:59,014 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor
[2019-10-13 20:11:59,015 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev
[2019-10-13 20:11:59,015 INFO L130 BoogieDeclarations]: Found specification of procedure random
[2019-10-13 20:11:59,015 INFO L130 BoogieDeclarations]: Found specification of procedure srandom
[2019-10-13 20:11:59,015 INFO L130 BoogieDeclarations]: Found specification of procedure initstate
[2019-10-13 20:11:59,015 INFO L130 BoogieDeclarations]: Found specification of procedure setstate
[2019-10-13 20:11:59,015 INFO L130 BoogieDeclarations]: Found specification of procedure random_r
[2019-10-13 20:11:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r
[2019-10-13 20:11:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r
[2019-10-13 20:11:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r
[2019-10-13 20:11:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure rand
[2019-10-13 20:11:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure srand
[2019-10-13 20:11:59,016 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r
[2019-10-13 20:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure drand48
[2019-10-13 20:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure erand48
[2019-10-13 20:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48
[2019-10-13 20:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48
[2019-10-13 20:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48
[2019-10-13 20:11:59,017 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48
[2019-10-13 20:11:59,018 INFO L130 BoogieDeclarations]: Found specification of procedure srand48
[2019-10-13 20:11:59,018 INFO L130 BoogieDeclarations]: Found specification of procedure seed48
[2019-10-13 20:11:59,018 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48
[2019-10-13 20:11:59,018 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r
[2019-10-13 20:11:59,018 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r
[2019-10-13 20:11:59,018 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r
[2019-10-13 20:11:59,019 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r
[2019-10-13 20:11:59,019 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r
[2019-10-13 20:11:59,019 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r
[2019-10-13 20:11:59,019 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r
[2019-10-13 20:11:59,019 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r
[2019-10-13 20:11:59,019 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r
[2019-10-13 20:11:59,019 INFO L130 BoogieDeclarations]: Found specification of procedure malloc
[2019-10-13 20:11:59,020 INFO L130 BoogieDeclarations]: Found specification of procedure calloc
[2019-10-13 20:11:59,020 INFO L130 BoogieDeclarations]: Found specification of procedure realloc
[2019-10-13 20:11:59,020 INFO L130 BoogieDeclarations]: Found specification of procedure free
[2019-10-13 20:11:59,020 INFO L130 BoogieDeclarations]: Found specification of procedure cfree
[2019-10-13 20:11:59,020 INFO L130 BoogieDeclarations]: Found specification of procedure alloca
[2019-10-13 20:11:59,020 INFO L130 BoogieDeclarations]: Found specification of procedure valloc
[2019-10-13 20:11:59,021 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign
[2019-10-13 20:11:59,021 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc
[2019-10-13 20:11:59,021 INFO L130 BoogieDeclarations]: Found specification of procedure abort
[2019-10-13 20:11:59,021 INFO L130 BoogieDeclarations]: Found specification of procedure atexit
[2019-10-13 20:11:59,021 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit
[2019-10-13 20:11:59,021 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit
[2019-10-13 20:11:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure exit
[2019-10-13 20:11:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit
[2019-10-13 20:11:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit
[2019-10-13 20:11:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure getenv
[2019-10-13 20:11:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure putenv
[2019-10-13 20:11:59,022 INFO L130 BoogieDeclarations]: Found specification of procedure setenv
[2019-10-13 20:11:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv
[2019-10-13 20:11:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv
[2019-10-13 20:11:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp
[2019-10-13 20:11:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp
[2019-10-13 20:11:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps
[2019-10-13 20:11:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp
[2019-10-13 20:11:59,023 INFO L130 BoogieDeclarations]: Found specification of procedure system
[2019-10-13 20:11:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure realpath
[2019-10-13 20:11:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch
[2019-10-13 20:11:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure qsort
[2019-10-13 20:11:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure abs
[2019-10-13 20:11:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure labs
[2019-10-13 20:11:59,024 INFO L130 BoogieDeclarations]: Found specification of procedure llabs
[2019-10-13 20:11:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure div
[2019-10-13 20:11:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv
[2019-10-13 20:11:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv
[2019-10-13 20:11:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt
[2019-10-13 20:11:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt
[2019-10-13 20:11:59,025 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt
[2019-10-13 20:11:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt
[2019-10-13 20:11:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt
[2019-10-13 20:11:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt
[2019-10-13 20:11:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r
[2019-10-13 20:11:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r
[2019-10-13 20:11:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r
[2019-10-13 20:11:59,026 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r
[2019-10-13 20:11:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure mblen
[2019-10-13 20:11:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc
[2019-10-13 20:11:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb
[2019-10-13 20:11:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs
[2019-10-13 20:11:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs
[2019-10-13 20:11:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch
[2019-10-13 20:11:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt
[2019-10-13 20:11:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg
[2019-10-13 20:11:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int
[2019-10-13 20:11:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error
[2019-10-13 20:11:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure main
[2019-10-13 20:11:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2019-10-13 20:11:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2019-10-13 20:11:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~int
[2019-10-13 20:11:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2019-10-13 20:11:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~int
[2019-10-13 20:11:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2019-10-13 20:11:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init
[2019-10-13 20:11:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2019-10-13 20:11:59,721 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2019-10-13 20:11:59,722 INFO L284 CfgBuilder]: Removed 31 assume(true) statements.
[2019-10-13 20:11:59,723 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:11:59 BoogieIcfgContainer
[2019-10-13 20:11:59,723 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2019-10-13 20:11:59,725 INFO L113 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2019-10-13 20:11:59,725 INFO L271 PluginConnector]: Initializing TraceAbstraction...
[2019-10-13 20:11:59,729 INFO L275 PluginConnector]: TraceAbstraction initialized
[2019-10-13 20:11:59,730 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:11:58" (1/3) ...
[2019-10-13 20:11:59,731 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c75add2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:11:59, skipping insertion in model container
[2019-10-13 20:11:59,731 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:58" (2/3) ...
[2019-10-13 20:11:59,732 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c75add2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:11:59, skipping insertion in model container
[2019-10-13 20:11:59,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:11:59" (3/3) ...
[2019-10-13 20:11:59,734 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-queue-1.i
[2019-10-13 20:11:59,743 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2019-10-13 20:11:59,752 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 14 error locations.
[2019-10-13 20:11:59,763 INFO L249 AbstractCegarLoop]: Starting to check reachability of 14 error locations.
[2019-10-13 20:11:59,797 INFO L373 AbstractCegarLoop]: Interprodecural is true
[2019-10-13 20:11:59,798 INFO L374 AbstractCegarLoop]: Hoare is true
[2019-10-13 20:11:59,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP
[2019-10-13 20:11:59,798 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE
[2019-10-13 20:11:59,804 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2019-10-13 20:11:59,804 INFO L378 AbstractCegarLoop]: Difference is false
[2019-10-13 20:11:59,804 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA
[2019-10-13 20:11:59,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce========
[2019-10-13 20:11:59,834 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states.
[2019-10-13 20:11:59,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10
[2019-10-13 20:11:59,844 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 20:11:59,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 20:11:59,851 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 20:11:59,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:11:59,858 INFO L82 PathProgramCache]: Analyzing trace with hash 786631415, now seen corresponding path program 1 times
[2019-10-13 20:11:59,869 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 20:11:59,870 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757418350]
[2019-10-13 20:11:59,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:11:59,870 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:11:59,871 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 20:11:59,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:00,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:00,026 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757418350]
[2019-10-13 20:12:00,027 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 20:12:00,027 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2019-10-13 20:12:00,028 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136483544]
[2019-10-13 20:12:00,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-10-13 20:12:00,033 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 20:12:00,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-10-13 20:12:00,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 20:12:00,046 INFO L87 Difference]: Start difference. First operand 90 states. Second operand 2 states.
[2019-10-13 20:12:00,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 20:12:00,077 INFO L93 Difference]: Finished difference Result 174 states and 284 transitions.
[2019-10-13 20:12:00,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2019-10-13 20:12:00,079 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9
[2019-10-13 20:12:00,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 20:12:00,091 INFO L225 Difference]: With dead ends: 174
[2019-10-13 20:12:00,091 INFO L226 Difference]: Without dead ends: 84
[2019-10-13 20:12:00,095 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 20:12:00,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states.
[2019-10-13 20:12:00,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84.
[2019-10-13 20:12:00,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states.
[2019-10-13 20:12:00,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 93 transitions.
[2019-10-13 20:12:00,140 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 93 transitions. Word has length 9
[2019-10-13 20:12:00,140 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 20:12:00,141 INFO L462 AbstractCegarLoop]: Abstraction has 84 states and 93 transitions.
[2019-10-13 20:12:00,141 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-10-13 20:12:00,141 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 93 transitions.
[2019-10-13 20:12:00,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11
[2019-10-13 20:12:00,142 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 20:12:00,142 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 20:12:00,142 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 20:12:00,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:12:00,143 INFO L82 PathProgramCache]: Analyzing trace with hash -1385985618, now seen corresponding path program 1 times
[2019-10-13 20:12:00,143 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 20:12:00,143 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640576457]
[2019-10-13 20:12:00,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,144 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,144 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 20:12:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:00,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:00,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640576457]
[2019-10-13 20:12:00,214 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 20:12:00,214 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 20:12:00,214 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895594611]
[2019-10-13 20:12:00,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 20:12:00,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 20:12:00,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 20:12:00,217 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 20:12:00,217 INFO L87 Difference]: Start difference. First operand 84 states and 93 transitions. Second operand 3 states.
[2019-10-13 20:12:00,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 20:12:00,307 INFO L93 Difference]: Finished difference Result 84 states and 93 transitions.
[2019-10-13 20:12:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 20:12:00,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10
[2019-10-13 20:12:00,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 20:12:00,310 INFO L225 Difference]: With dead ends: 84
[2019-10-13 20:12:00,310 INFO L226 Difference]: Without dead ends: 74
[2019-10-13 20:12:00,311 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 20:12:00,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states.
[2019-10-13 20:12:00,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74.
[2019-10-13 20:12:00,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states.
[2019-10-13 20:12:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 83 transitions.
[2019-10-13 20:12:00,330 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 83 transitions. Word has length 10
[2019-10-13 20:12:00,331 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 20:12:00,331 INFO L462 AbstractCegarLoop]: Abstraction has 74 states and 83 transitions.
[2019-10-13 20:12:00,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 20:12:00,331 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 83 transitions.
[2019-10-13 20:12:00,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14
[2019-10-13 20:12:00,334 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 20:12:00,334 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 20:12:00,335 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 20:12:00,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:12:00,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1923530661, now seen corresponding path program 1 times
[2019-10-13 20:12:00,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 20:12:00,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119175482]
[2019-10-13 20:12:00,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,336 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 20:12:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:00,452 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:00,453 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119175482]
[2019-10-13 20:12:00,453 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 20:12:00,453 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 20:12:00,453 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289796850]
[2019-10-13 20:12:00,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 20:12:00,454 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 20:12:00,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 20:12:00,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 20:12:00,454 INFO L87 Difference]: Start difference. First operand 74 states and 83 transitions. Second operand 4 states.
[2019-10-13 20:12:00,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 20:12:00,521 INFO L93 Difference]: Finished difference Result 74 states and 83 transitions.
[2019-10-13 20:12:00,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 20:12:00,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13
[2019-10-13 20:12:00,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 20:12:00,523 INFO L225 Difference]: With dead ends: 74
[2019-10-13 20:12:00,523 INFO L226 Difference]: Without dead ends: 72
[2019-10-13 20:12:00,524 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 20:12:00,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states.
[2019-10-13 20:12:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72.
[2019-10-13 20:12:00,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states.
[2019-10-13 20:12:00,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions.
[2019-10-13 20:12:00,532 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 13
[2019-10-13 20:12:00,532 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 20:12:00,533 INFO L462 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions.
[2019-10-13 20:12:00,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 20:12:00,533 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions.
[2019-10-13 20:12:00,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17
[2019-10-13 20:12:00,534 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 20:12:00,534 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 20:12:00,534 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 20:12:00,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:12:00,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1449483421, now seen corresponding path program 1 times
[2019-10-13 20:12:00,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 20:12:00,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896147346]
[2019-10-13 20:12:00,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 20:12:00,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:00,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:00,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896147346]
[2019-10-13 20:12:00,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 20:12:00,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 20:12:00,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185110359]
[2019-10-13 20:12:00,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 20:12:00,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 20:12:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 20:12:00,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 20:12:00,603 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand 3 states.
[2019-10-13 20:12:00,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 20:12:00,650 INFO L93 Difference]: Finished difference Result 157 states and 182 transitions.
[2019-10-13 20:12:00,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 20:12:00,651 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16
[2019-10-13 20:12:00,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 20:12:00,652 INFO L225 Difference]: With dead ends: 157
[2019-10-13 20:12:00,652 INFO L226 Difference]: Without dead ends: 91
[2019-10-13 20:12:00,653 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 20:12:00,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states.
[2019-10-13 20:12:00,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 80.
[2019-10-13 20:12:00,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states.
[2019-10-13 20:12:00,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions.
[2019-10-13 20:12:00,663 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 16
[2019-10-13 20:12:00,663 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 20:12:00,663 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions.
[2019-10-13 20:12:00,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 20:12:00,663 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions.
[2019-10-13 20:12:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-10-13 20:12:00,664 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 20:12:00,664 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 20:12:00,665 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 20:12:00,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:12:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash 1095322203, now seen corresponding path program 1 times
[2019-10-13 20:12:00,666 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 20:12:00,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275471270]
[2019-10-13 20:12:00,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,666 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 20:12:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:00,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:00,745 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275471270]
[2019-10-13 20:12:00,745 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 20:12:00,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2019-10-13 20:12:00,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071255546]
[2019-10-13 20:12:00,746 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states
[2019-10-13 20:12:00,746 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 20:12:00,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2019-10-13 20:12:00,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2019-10-13 20:12:00,747 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand 3 states.
[2019-10-13 20:12:00,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 20:12:00,773 INFO L93 Difference]: Finished difference Result 83 states and 93 transitions.
[2019-10-13 20:12:00,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2019-10-13 20:12:00,775 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21
[2019-10-13 20:12:00,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 20:12:00,777 INFO L225 Difference]: With dead ends: 83
[2019-10-13 20:12:00,777 INFO L226 Difference]: Without dead ends: 81
[2019-10-13 20:12:00,777 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 20:12:00,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states.
[2019-10-13 20:12:00,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81.
[2019-10-13 20:12:00,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states.
[2019-10-13 20:12:00,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 91 transitions.
[2019-10-13 20:12:00,785 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 91 transitions. Word has length 21
[2019-10-13 20:12:00,785 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 20:12:00,785 INFO L462 AbstractCegarLoop]: Abstraction has 81 states and 91 transitions.
[2019-10-13 20:12:00,786 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states.
[2019-10-13 20:12:00,786 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 91 transitions.
[2019-10-13 20:12:00,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22
[2019-10-13 20:12:00,787 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 20:12:00,787 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 20:12:00,787 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 20:12:00,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:12:00,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1095324125, now seen corresponding path program 1 times
[2019-10-13 20:12:00,788 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 20:12:00,788 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [705028387]
[2019-10-13 20:12:00,788 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,789 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 20:12:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:00,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [705028387]
[2019-10-13 20:12:00,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2019-10-13 20:12:00,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4
[2019-10-13 20:12:00,837 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967198265]
[2019-10-13 20:12:00,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states
[2019-10-13 20:12:00,838 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN
[2019-10-13 20:12:00,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2019-10-13 20:12:00,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12
[2019-10-13 20:12:00,839 INFO L87 Difference]: Start difference. First operand 81 states and 91 transitions. Second operand 4 states.
[2019-10-13 20:12:00,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 20:12:00,909 INFO L93 Difference]: Finished difference Result 101 states and 115 transitions.
[2019-10-13 20:12:00,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states.
[2019-10-13 20:12:00,910 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21
[2019-10-13 20:12:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 20:12:00,911 INFO L225 Difference]: With dead ends: 101
[2019-10-13 20:12:00,911 INFO L226 Difference]: Without dead ends: 76
[2019-10-13 20:12:00,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20
[2019-10-13 20:12:00,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states.
[2019-10-13 20:12:00,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76.
[2019-10-13 20:12:00,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states.
[2019-10-13 20:12:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 85 transitions.
[2019-10-13 20:12:00,924 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 85 transitions. Word has length 21
[2019-10-13 20:12:00,924 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 20:12:00,924 INFO L462 AbstractCegarLoop]: Abstraction has 76 states and 85 transitions.
[2019-10-13 20:12:00,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states.
[2019-10-13 20:12:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 85 transitions.
[2019-10-13 20:12:00,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24
[2019-10-13 20:12:00,929 INFO L372 BasicCegarLoop]: Found error trace
[2019-10-13 20:12:00,929 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2019-10-13 20:12:00,929 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION]===
[2019-10-13 20:12:00,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:12:00,930 INFO L82 PathProgramCache]: Analyzing trace with hash -648846271, now seen corresponding path program 1 times
[2019-10-13 20:12:00,931 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN
[2019-10-13 20:12:00,931 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679330515]
[2019-10-13 20:12:00,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,931 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY
[2019-10-13 20:12:00,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2019-10-13 20:12:00,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:01,063 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:01,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679330515]
[2019-10-13 20:12:01,064 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [760518325]
[2019-10-13 20:12:01,064 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 20:12:01,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2019-10-13 20:12:01,176 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 18 conjunts are in the unsatisfiable core
[2019-10-13 20:12:01,183 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2019-10-13 20:12:01,246 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5
[2019-10-13 20:12:01,247 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 20:12:01,261 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 20:12:01,261 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 20:12:01,262 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12
[2019-10-13 20:12:01,296 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 20:12:01,296 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15
[2019-10-13 20:12:01,297 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 20:12:01,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 20:12:01,316 INFO L189 IndexEqualityManager]: detected not equals via solver
[2019-10-13 20:12:01,371 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 20:12:01,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 81
[2019-10-13 20:12:01,373 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts.
[2019-10-13 20:12:01,424 INFO L567 ElimStorePlain]: treesize reduction 48, result has 46.1 percent of original size
[2019-10-13 20:12:01,427 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 20:12:01,427 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:31
[2019-10-13 20:12:01,508 INFO L341 Elim1Store]: treesize reduction 38, result has 56.3 percent of original size
[2019-10-13 20:12:01,509 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 78
[2019-10-13 20:12:01,511 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms
[2019-10-13 20:12:01,512 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:01,519 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:01,521 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts.
[2019-10-13 20:12:01,585 INFO L567 ElimStorePlain]: treesize reduction 80, result has 25.9 percent of original size
[2019-10-13 20:12:01,586 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 20:12:01,586 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:28
[2019-10-13 20:12:01,658 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 20:12:01,659 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 30
[2019-10-13 20:12:01,660 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts.
[2019-10-13 20:12:01,673 INFO L567 ElimStorePlain]: treesize reduction 12, result has 42.9 percent of original size
[2019-10-13 20:12:01,674 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts.
[2019-10-13 20:12:01,674 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:35, output treesize:4
[2019-10-13 20:12:01,683 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:01,684 INFO L321 TraceCheckSpWp]: Computing backward predicates...
[2019-10-13 20:12:01,702 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 20:12:01,705 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size
[2019-10-13 20:12:01,706 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts.
[2019-10-13 20:12:01,706 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18
[2019-10-13 20:12:01,771 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44017 treesize of output 43761
[2019-10-13 20:12:01,813 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts.
[2019-10-13 20:12:03,050 WARN L191 SmtUtils]: Spent 1.23 s on a formula simplification. DAG size of input: 309 DAG size of output: 43
[2019-10-13 20:12:03,051 INFO L567 ElimStorePlain]: treesize reduction 43314, result has 0.2 percent of original size
[2019-10-13 20:12:03,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,070 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,072 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms
[2019-10-13 20:12:03,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 4 xjuncts.
[2019-10-13 20:12:03,076 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:143, output treesize:77
[2019-10-13 20:12:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2019-10-13 20:12:03,154 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1075105828]
[2019-10-13 20:12:03,160 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 24
[2019-10-13 20:12:03,203 INFO L148 AbstractInterpreter]: Using domain IntervalDomain
[2019-10-13 20:12:03,203 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2)
[2019-10-13 20:12:03,284 INFO L266 AbstractInterpreter]: Error location(s) were unreachable
[2019-10-13 20:12:03,286 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 32 variables.
[2019-10-13 20:12:03,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier
[2019-10-13 20:12:03,291 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates
[2019-10-13 20:12:03,340 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes.
[2019-10-13 20:12:03,340 INFO L551 sIntCurrentIteration]: Unifying AI predicates
[2019-10-13 20:12:03,343 INFO L553 sIntCurrentIteration]: We unified 22 AI predicates to 22
[2019-10-13 20:12:03,343 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates
[2019-10-13 20:12:03,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences.
[2019-10-13 20:12:03,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [6, 6, 6] total 10
[2019-10-13 20:12:03,344 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958364837]
[2019-10-13 20:12:03,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states
[2019-10-13 20:12:03,346 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN
[2019-10-13 20:12:03,346 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy
[2019-10-13 20:12:03,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2019-10-13 20:12:03,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2019-10-13 20:12:03,348 INFO L87 Difference]: Start difference. First operand 76 states and 85 transitions. Second operand 2 states.
[2019-10-13 20:12:03,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2019-10-13 20:12:03,349 INFO L93 Difference]: Finished difference Result 76 states and 85 transitions.
[2019-10-13 20:12:03,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states.
[2019-10-13 20:12:03,350 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 23
[2019-10-13 20:12:03,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2019-10-13 20:12:03,350 INFO L225 Difference]: With dead ends: 76
[2019-10-13 20:12:03,350 INFO L226 Difference]: Without dead ends: 0
[2019-10-13 20:12:03,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 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 20:12:03,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2019-10-13 20:12:03,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2019-10-13 20:12:03,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states.
[2019-10-13 20:12:03,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2019-10-13 20:12:03,355 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23
[2019-10-13 20:12:03,355 INFO L84 Accepts]: Finished accepts. word is rejected.
[2019-10-13 20:12:03,355 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2019-10-13 20:12:03,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states.
[2019-10-13 20:12:03,356 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2019-10-13 20:12:03,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2019-10-13 20:12:03,560 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2019-10-13 20:12:03,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2019-10-13 20:12:03,604 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 20:12:03,605 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true
[2019-10-13 20:12:03,605 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 20:12:03,605 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed.
[2019-10-13 20:12:03,605 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true
[2019-10-13 20:12:03,605 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true
[2019-10-13 20:12:03,606 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed.
[2019-10-13 20:12:03,606 INFO L443 ceAbstractionStarter]: For program point L993-1(lines 993 1018) no Hoare annotation was computed.
[2019-10-13 20:12:03,606 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 983 1057) no Hoare annotation was computed.
[2019-10-13 20:12:03,606 INFO L443 ceAbstractionStarter]: For program point L1010(lines 1010 1014) no Hoare annotation was computed.
[2019-10-13 20:12:03,606 INFO L443 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1028) no Hoare annotation was computed.
[2019-10-13 20:12:03,606 INFO L443 ceAbstractionStarter]: For program point L1044-1(line 1044) no Hoare annotation was computed.
[2019-10-13 20:12:03,606 INFO L443 ceAbstractionStarter]: For program point L1044-3(line 1044) no Hoare annotation was computed.
[2019-10-13 20:12:03,607 INFO L443 ceAbstractionStarter]: For program point L1044-4(line 1044) no Hoare annotation was computed.
[2019-10-13 20:12:03,607 INFO L443 ceAbstractionStarter]: For program point L1044-6(line 1044) no Hoare annotation was computed.
[2019-10-13 20:12:03,607 INFO L439 ceAbstractionStarter]: At program point L1044-7(line 1044) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base)))
[2019-10-13 20:12:03,607 INFO L443 ceAbstractionStarter]: For program point L1044-8(line 1044) no Hoare annotation was computed.
[2019-10-13 20:12:03,607 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1016) no Hoare annotation was computed.
[2019-10-13 20:12:03,607 INFO L443 ceAbstractionStarter]: For program point L1028-1(line 1028) no Hoare annotation was computed.
[2019-10-13 20:12:03,608 INFO L443 ceAbstractionStarter]: For program point L1028-3(line 1028) no Hoare annotation was computed.
[2019-10-13 20:12:03,608 INFO L439 ceAbstractionStarter]: At program point L1028-4(line 1028) the Hoare annotation is: false
[2019-10-13 20:12:03,608 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 983 1057) no Hoare annotation was computed.
[2019-10-13 20:12:03,608 INFO L443 ceAbstractionStarter]: For program point L1029(line 1029) no Hoare annotation was computed.
[2019-10-13 20:12:03,608 INFO L443 ceAbstractionStarter]: For program point L1029-1(line 1029) no Hoare annotation was computed.
[2019-10-13 20:12:03,608 INFO L443 ceAbstractionStarter]: For program point L1029-3(line 1029) no Hoare annotation was computed.
[2019-10-13 20:12:03,608 INFO L443 ceAbstractionStarter]: For program point L1029-4(lines 1027 1031) no Hoare annotation was computed.
[2019-10-13 20:12:03,609 INFO L443 ceAbstractionStarter]: For program point L1030(line 1030) no Hoare annotation was computed.
[2019-10-13 20:12:03,609 INFO L443 ceAbstractionStarter]: For program point L1030-1(line 1030) no Hoare annotation was computed.
[2019-10-13 20:12:03,609 INFO L443 ceAbstractionStarter]: For program point mainErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1036) no Hoare annotation was computed.
[2019-10-13 20:12:03,609 INFO L443 ceAbstractionStarter]: For program point L1030-3(line 1030) no Hoare annotation was computed.
[2019-10-13 20:12:03,609 INFO L443 ceAbstractionStarter]: For program point L1030-4(lines 1027 1031) no Hoare annotation was computed.
[2019-10-13 20:12:03,609 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed.
[2019-10-13 20:12:03,609 INFO L443 ceAbstractionStarter]: For program point L1032(lines 1032 1039) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point mainErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1038) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point L1016(line 1016) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point L1049-1(lines 984 1057) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point L1049-2(lines 1049 1054) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point L1016-2(line 1016) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point L1016-3(lines 994 1018) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1014) no Hoare annotation was computed.
[2019-10-13 20:12:03,610 INFO L443 ceAbstractionStarter]: For program point mainErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1037) no Hoare annotation was computed.
[2019-10-13 20:12:03,611 INFO L443 ceAbstractionStarter]: For program point L1017(line 1017) no Hoare annotation was computed.
[2019-10-13 20:12:03,611 INFO L443 ceAbstractionStarter]: For program point L1017-2(line 1017) no Hoare annotation was computed.
[2019-10-13 20:12:03,611 INFO L443 ceAbstractionStarter]: For program point L1017-3(lines 994 1018) no Hoare annotation was computed.
[2019-10-13 20:12:03,611 INFO L439 ceAbstractionStarter]: At program point L1017-4(lines 993 1018) the Hoare annotation is: false
[2019-10-13 20:12:03,611 INFO L443 ceAbstractionStarter]: For program point L1034-1(line 1034) no Hoare annotation was computed.
[2019-10-13 20:12:03,611 INFO L443 ceAbstractionStarter]: For program point L1034-3(line 1034) no Hoare annotation was computed.
[2019-10-13 20:12:03,611 INFO L439 ceAbstractionStarter]: At program point L1034-4(line 1034) the Hoare annotation is: false
[2019-10-13 20:12:03,612 INFO L443 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1029) no Hoare annotation was computed.
[2019-10-13 20:12:03,612 INFO L443 ceAbstractionStarter]: For program point L1035(line 1035) no Hoare annotation was computed.
[2019-10-13 20:12:03,612 INFO L443 ceAbstractionStarter]: For program point L1035-1(line 1035) no Hoare annotation was computed.
[2019-10-13 20:12:03,612 INFO L443 ceAbstractionStarter]: For program point L1035-3(line 1035) no Hoare annotation was computed.
[2019-10-13 20:12:03,612 INFO L443 ceAbstractionStarter]: For program point L1035-4(lines 1033 1039) no Hoare annotation was computed.
[2019-10-13 20:12:03,612 INFO L443 ceAbstractionStarter]: For program point mainErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1044) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1034) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1036(line 1036) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1036-1(line 1036) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1036-3(line 1036) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1036-4(lines 1033 1039) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1020(line 1020) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1020-2(line 1020) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1020-3(lines 984 1057) no Hoare annotation was computed.
[2019-10-13 20:12:03,613 INFO L443 ceAbstractionStarter]: For program point L1020-4(lines 984 1057) no Hoare annotation was computed.
[2019-10-13 20:12:03,614 INFO L443 ceAbstractionStarter]: For program point L1037(line 1037) no Hoare annotation was computed.
[2019-10-13 20:12:03,614 INFO L443 ceAbstractionStarter]: For program point L1037-1(line 1037) no Hoare annotation was computed.
[2019-10-13 20:12:03,614 INFO L443 ceAbstractionStarter]: For program point L1037-3(line 1037) no Hoare annotation was computed.
[2019-10-13 20:12:03,614 INFO L443 ceAbstractionStarter]: For program point L1037-4(lines 1033 1039) no Hoare annotation was computed.
[2019-10-13 20:12:03,614 INFO L443 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1030) no Hoare annotation was computed.
[2019-10-13 20:12:03,614 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 983 1057) the Hoare annotation is: true
[2019-10-13 20:12:03,614 INFO L443 ceAbstractionStarter]: For program point L1021(lines 984 1057) no Hoare annotation was computed.
[2019-10-13 20:12:03,614 INFO L443 ceAbstractionStarter]: For program point L1038(line 1038) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1014) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point L1038-1(line 1038) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point L1038-3(line 1038) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point L1038-4(lines 1033 1039) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1020) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1035) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point L1023-1(line 1023) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L443 ceAbstractionStarter]: For program point L1023-3(line 1023) no Hoare annotation was computed.
[2019-10-13 20:12:03,615 INFO L439 ceAbstractionStarter]: At program point L1023-4(line 1023) the Hoare annotation is: false
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1024) no Hoare annotation was computed.
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point L1024(line 1024) no Hoare annotation was computed.
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point L1024-1(line 1024) no Hoare annotation was computed.
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point L1024-3(line 1024) no Hoare annotation was computed.
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point L1024-4(lines 1022 1025) no Hoare annotation was computed.
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1023) no Hoare annotation was computed.
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point L1042-1(line 1042) no Hoare annotation was computed.
[2019-10-13 20:12:03,616 INFO L443 ceAbstractionStarter]: For program point L1042-3(lines 1042 1046) no Hoare annotation was computed.
[2019-10-13 20:12:03,617 INFO L439 ceAbstractionStarter]: At program point L1042-5(lines 1042 1046) the Hoare annotation is: (and (= main_~status~0 0) (not (= 0 main_~head~0.base)))
[2019-10-13 20:12:03,617 INFO L443 ceAbstractionStarter]: For program point L1026(lines 984 1057) no Hoare annotation was computed.
[2019-10-13 20:12:03,630 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:03 BoogieIcfgContainer
[2019-10-13 20:12:03,630 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2019-10-13 20:12:03,632 INFO L168 Benchmark]: Toolchain (without parser) took 5468.30 ms. Allocated memory was 142.6 MB in the beginning and 255.3 MB in the end (delta: 112.7 MB). Free memory was 98.3 MB in the beginning and 138.0 MB in the end (delta: -39.7 MB). Peak memory consumption was 73.0 MB. Max. memory is 7.1 GB.
[2019-10-13 20:12:03,633 INFO L168 Benchmark]: CDTParser took 1.20 ms. Allocated memory is still 142.6 MB. Free memory was 117.8 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
[2019-10-13 20:12:03,634 INFO L168 Benchmark]: CACSL2BoogieTranslator took 670.63 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.1 MB in the beginning and 166.5 MB in the end (delta: -68.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB.
[2019-10-13 20:12:03,635 INFO L168 Benchmark]: Boogie Preprocessor took 109.77 ms. Allocated memory is still 199.8 MB. Free memory was 166.5 MB in the beginning and 163.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB.
[2019-10-13 20:12:03,636 INFO L168 Benchmark]: RCFGBuilder took 777.24 ms. Allocated memory is still 199.8 MB. Free memory was 163.0 MB in the beginning and 107.8 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB.
[2019-10-13 20:12:03,637 INFO L168 Benchmark]: TraceAbstraction took 3905.89 ms. Allocated memory was 199.8 MB in the beginning and 255.3 MB in the end (delta: 55.6 MB). Free memory was 107.8 MB in the beginning and 138.0 MB in the end (delta: -30.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB.
[2019-10-13 20:12:03,641 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 1.20 ms. Allocated memory is still 142.6 MB. Free memory was 117.8 MB in the beginning and 117.5 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB.
* CACSL2BoogieTranslator took 670.63 ms. Allocated memory was 142.6 MB in the beginning and 199.8 MB in the end (delta: 57.1 MB). Free memory was 98.1 MB in the beginning and 166.5 MB in the end (delta: -68.4 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB.
* Boogie Preprocessor took 109.77 ms. Allocated memory is still 199.8 MB. Free memory was 166.5 MB in the beginning and 163.0 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB.
* RCFGBuilder took 777.24 ms. Allocated memory is still 199.8 MB. Free memory was 163.0 MB in the beginning and 107.8 MB in the end (delta: 55.2 MB). Peak memory consumption was 55.2 MB. Max. memory is 7.1 GB.
* TraceAbstraction took 3905.89 ms. Allocated memory was 199.8 MB in the beginning and 255.3 MB in the end (delta: 55.6 MB). Free memory was 107.8 MB in the beginning and 138.0 MB in the end (delta: -30.2 MB). Peak memory consumption was 25.4 MB. Max. memory is 7.1 GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- PositiveResult [Line: 1037]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1044]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1035]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1036]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1038]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1016]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1030]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1034]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1029]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1028]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- PositiveResult [Line: 1023]: call of __VERIFIER_error() unreachable
For all program executions holds that call of __VERIFIER_error() unreachable at this location
- AllSpecificationsHoldResult: All specifications hold
14 specifications checked. All of them hold
- InvariantResult [Line: 1028]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 993]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 1044]: Loop Invariant
Derived loop invariant: status == 0 && !(0 == head)
- InvariantResult [Line: 1042]: Loop Invariant
Derived loop invariant: status == 0 && !(0 == head)
- InvariantResult [Line: 1034]: Loop Invariant
Derived loop invariant: 0
- InvariantResult [Line: 1023]: Loop Invariant
Derived loop invariant: 0
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 3 procedures, 90 locations, 14 error locations. Result: SAFE, OverallTime: 3.8s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 481 SDtfs, 217 SDslu, 313 SDs, 0 SdLazy, 79 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 43 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred 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, 7 MinimizatonAttempts, 11 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 10 LocationsWithAnnotation, 10 PreInvPairs, 12 NumberOfFragments, 24 HoareAnnotationTreeSize, 10 FomulaSimplifications, 18 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 10 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 150 ConstructedInterpolants, 15 QuantifiedInterpolants, 18699 SizeOfPredicates, 10 NumberOfNonLiveVariables, 104 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 131, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9204545454545454, AVG_VARS_REMOVED_DURING_WEAKENING: 0.7727272727272727, AVG_WEAKENED_CONJUNCTS: 0.2727272727272727, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available
RESULT: Ultimate proved your program to be correct!
Received shutdown request...