/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 19:04:23,181 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 19:04:23,184 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 19:04:23,201 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 19:04:23,202 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 19:04:23,204 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 19:04:23,205 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 19:04:23,207 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 19:04:23,209 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 19:04:23,210 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 19:04:23,211 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 19:04:23,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 19:04:23,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 19:04:23,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 19:04:23,214 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 19:04:23,215 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 19:04:23,216 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 19:04:23,217 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 19:04:23,219 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 19:04:23,221 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 19:04:23,222 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 19:04:23,223 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 19:04:23,224 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 19:04:23,225 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 19:04:23,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 19:04:23,228 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 19:04:23,228 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 19:04:23,229 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 19:04:23,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 19:04:23,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 19:04:23,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 19:04:23,234 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 19:04:23,235 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 19:04:23,235 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 19:04:23,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 19:04:23,238 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 19:04:23,241 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 19:04:23,241 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 19:04:23,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 19:04:23,242 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 19:04:23,245 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 19:04:23,245 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 19:04:23,267 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 19:04:23,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 19:04:23,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 19:04:23,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 19:04:23,270 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 19:04:23,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 19:04:23,271 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 19:04:23,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 19:04:23,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 19:04:23,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 19:04:23,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 19:04:23,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 19:04:23,273 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 19:04:23,273 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 19:04:23,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 19:04:23,274 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 19:04:23,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 19:04:23,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 19:04:23,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 19:04:23,275 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 19:04:23,275 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 19:04:23,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 19:04:23,275 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 19:04:23,276 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 19:04:23,276 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 19:04:23,276 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 19:04:23,276 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 19:04:23,276 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 19:04:23,277 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 19:04:23,277 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 19:04:23,278 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 19:04:23,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 19:04:23,603 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 19:04:23,607 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 19:04:23,608 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 19:04:23,609 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 19:04:23,609 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2019-12-27 19:04:23,682 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3228d4638/434ec50b8beb4fbba74532ffb6227f95/FLAG4b1e6cb6b [2019-12-27 19:04:24,284 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 19:04:24,285 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo-bug_1w1r.i [2019-12-27 19:04:24,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3228d4638/434ec50b8beb4fbba74532ffb6227f95/FLAG4b1e6cb6b [2019-12-27 19:04:24,501 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3228d4638/434ec50b8beb4fbba74532ffb6227f95 [2019-12-27 19:04:24,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 19:04:24,511 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 19:04:24,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 19:04:24,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 19:04:24,515 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 19:04:24,516 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:24" (1/1) ... [2019-12-27 19:04:24,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f61a3fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:24, skipping insertion in model container [2019-12-27 19:04:24,520 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:24" (1/1) ... [2019-12-27 19:04:24,526 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 19:04:24,575 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 19:04:24,766 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 19:04:25,254 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:04:25,271 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 19:04:25,289 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 19:04:25,344 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 19:04:25,536 INFO L208 MainTranslator]: Completed translation [2019-12-27 19:04:25,537 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25 WrapperNode [2019-12-27 19:04:25,537 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 19:04:25,538 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 19:04:25,538 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 19:04:25,539 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 19:04:25,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,600 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,677 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 19:04:25,683 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 19:04:25,683 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 19:04:25,683 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 19:04:25,695 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,695 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,715 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,762 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,786 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (1/1) ... [2019-12-27 19:04:25,797 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 19:04:25,798 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 19:04:25,798 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 19:04:25,798 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 19:04:25,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (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-12-27 19:04:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2019-12-27 19:04:25,873 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2019-12-27 19:04:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 19:04:25,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-27 19:04:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 19:04:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 19:04:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 19:04:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 19:04:25,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 19:04:25,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 19:04:25,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 19:04:25,877 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 19:04:27,037 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 19:04:27,038 INFO L287 CfgBuilder]: Removed 40 assume(true) statements. [2019-12-27 19:04:27,039 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:27 BoogieIcfgContainer [2019-12-27 19:04:27,039 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 19:04:27,041 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 19:04:27,044 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 19:04:27,047 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 19:04:27,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:24" (1/3) ... [2019-12-27 19:04:27,048 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5458cf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:27, skipping insertion in model container [2019-12-27 19:04:27,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:25" (2/3) ... [2019-12-27 19:04:27,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5458cf7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:27, skipping insertion in model container [2019-12-27 19:04:27,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:27" (3/3) ... [2019-12-27 19:04:27,055 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo-bug_1w1r.i [2019-12-27 19:04:27,066 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 19:04:27,066 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 19:04:27,075 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-27 19:04:27,076 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 19:04:27,148 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,149 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,149 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,149 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,150 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,150 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,150 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,150 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,150 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,151 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,151 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,151 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,151 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,151 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,152 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,152 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,152 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,152 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,152 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,153 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,153 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,153 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,153 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,153 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,153 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,154 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,154 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,154 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,154 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,154 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,154 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,155 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,155 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,155 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,155 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,155 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,155 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,156 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,156 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,156 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,156 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,156 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,157 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,157 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,157 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,157 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,157 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,157 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,158 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,158 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,158 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,158 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,158 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,159 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,159 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,159 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,159 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,159 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,159 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,160 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,160 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,160 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,160 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,160 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,161 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,161 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,161 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,161 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,161 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,161 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,162 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,162 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,162 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,162 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,162 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,163 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,163 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,163 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,163 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,163 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,163 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,164 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,164 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,164 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,164 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,164 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,165 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,165 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,165 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,165 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,165 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,166 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,166 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,166 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,166 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,166 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,167 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,167 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,167 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,167 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,167 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,168 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,168 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,168 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,168 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,168 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,168 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,169 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,169 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,169 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,169 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,169 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,170 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,170 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,170 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,170 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,170 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,171 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,171 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,171 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,171 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,171 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,172 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,172 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,172 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,172 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,172 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,173 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,173 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,173 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,173 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,173 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,174 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,174 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,174 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,174 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,174 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,174 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,175 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,175 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,175 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,175 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,175 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,176 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,176 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,176 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,176 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,176 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,176 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,177 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,177 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,177 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,177 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,177 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,177 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,178 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,178 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,178 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,178 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,178 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,178 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,179 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,179 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,179 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,179 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,179 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,179 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,180 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,180 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,180 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,180 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,180 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,181 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,181 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,181 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,181 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,181 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,182 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,182 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,182 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,182 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,182 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,183 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,183 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,183 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,183 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,183 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,183 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,184 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,184 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,187 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,188 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,188 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,188 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,188 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,188 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,188 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,189 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,189 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,189 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,189 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,189 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,190 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,190 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,191 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,191 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,192 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,192 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,192 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,192 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,192 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,193 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,194 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,194 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,194 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,194 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,194 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,195 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,195 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,195 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,195 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,195 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 19:04:27,215 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 19:04:27,235 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 19:04:27,235 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 19:04:27,236 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 19:04:27,236 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 19:04:27,236 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 19:04:27,236 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 19:04:27,236 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 19:04:27,236 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 19:04:27,259 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 426 places, 455 transitions [2019-12-27 19:04:27,261 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions [2019-12-27 19:04:27,515 INFO L132 PetriNetUnfolder]: 33/454 cut-off events. [2019-12-27 19:04:27,515 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 19:04:27,552 INFO L76 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2019-12-27 19:04:27,611 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 426 places, 455 transitions [2019-12-27 19:04:27,721 INFO L132 PetriNetUnfolder]: 33/454 cut-off events. [2019-12-27 19:04:27,721 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 19:04:27,734 INFO L76 FinitePrefix]: Finished finitePrefix Result has 459 conditions, 454 events. 33/454 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1111 event pairs. 0/410 useless extension candidates. Maximal degree in co-relation 328. Up to 3 conditions per place. [2019-12-27 19:04:27,767 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 31742 [2019-12-27 19:04:27,768 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 19:04:29,570 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:29,585 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:29,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:29,586 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2019-12-27 19:04:29,942 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:29,954 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:29,955 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:29,955 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2019-12-27 19:04:31,500 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:31,543 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:31,544 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:31,544 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2019-12-27 19:04:31,559 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:31,586 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:31,586 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:31,587 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2019-12-27 19:04:34,263 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:34,290 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:34,291 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:34,291 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2019-12-27 19:04:34,323 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:34,350 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:34,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:34,352 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2019-12-27 19:04:36,836 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:36,863 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:36,864 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:36,865 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2019-12-27 19:04:37,230 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:37,261 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:37,262 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:37,262 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2019-12-27 19:04:37,274 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:37,345 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:37,345 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:37,346 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2019-12-27 19:04:40,056 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:40,087 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:40,088 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:40,089 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:112 [2019-12-27 19:04:40,101 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:40,128 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:40,129 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:40,129 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2019-12-27 19:04:42,183 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:42,214 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:42,215 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:42,215 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2019-12-27 19:04:42,226 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:42,250 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:42,250 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:42,251 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2019-12-27 19:04:44,341 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:44,373 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:44,374 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:44,374 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:107, output treesize:108 [2019-12-27 19:04:44,391 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:44,416 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:44,417 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:44,417 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:111, output treesize:112 [2019-12-27 19:04:46,650 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:46,680 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:46,681 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:46,681 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2019-12-27 19:04:46,706 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:46,735 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:46,736 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:46,736 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2019-12-27 19:04:48,880 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:48,907 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:48,908 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:48,908 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:103, output treesize:104 [2019-12-27 19:04:48,948 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:48,974 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:48,975 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:48,976 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:109, output treesize:110 [2019-12-27 19:04:51,293 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:51,319 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:51,320 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:51,320 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:04:51,331 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:51,359 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:51,360 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:51,361 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2019-12-27 19:04:53,704 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:53,732 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:53,733 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:53,733 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2019-12-27 19:04:53,744 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:53,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:53,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:53,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:04:55,897 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:55,955 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:55,957 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:55,957 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:172, output treesize:181 [2019-12-27 19:04:56,244 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:56,269 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:56,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:56,271 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:04:56,279 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:56,304 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:56,305 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:56,306 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:105 [2019-12-27 19:04:58,607 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:58,634 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:58,635 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:58,635 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2019-12-27 19:04:58,651 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:58,676 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:04:58,677 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:04:58,677 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:05:00,712 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:00,748 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:00,749 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:00,749 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2019-12-27 19:05:00,760 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:00,785 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:00,786 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:00,786 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:05:03,056 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:05:03,453 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:03,482 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:03,483 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:03,483 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:05:03,492 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:03,515 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:03,515 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:03,516 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2019-12-27 19:05:05,911 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:05,941 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:05,942 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:05,943 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:05:05,961 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:05,996 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:05,997 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:05,998 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:99 [2019-12-27 19:05:08,295 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:05:08,893 WARN L192 SmtUtils]: Spent 220.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2019-12-27 19:05:09,065 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-12-27 19:05:09,151 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:09,177 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:09,177 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:09,178 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:104, output treesize:105 [2019-12-27 19:05:09,186 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:09,210 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:09,211 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:09,211 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:102, output treesize:103 [2019-12-27 19:05:12,171 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:05:12,397 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 19:05:12,667 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-12-27 19:05:12,994 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 87 [2019-12-27 19:05:13,248 WARN L192 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2019-12-27 19:05:13,773 WARN L192 SmtUtils]: Spent 316.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-12-27 19:05:14,125 WARN L192 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2019-12-27 19:05:14,579 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 56 [2019-12-27 19:05:14,769 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 58 [2019-12-27 19:05:15,221 WARN L192 SmtUtils]: Spent 405.00 ms on a formula simplification that was a NOOP. DAG size: 132 [2019-12-27 19:05:15,639 WARN L192 SmtUtils]: Spent 415.00 ms on a formula simplification that was a NOOP. DAG size: 128 [2019-12-27 19:05:17,763 WARN L192 SmtUtils]: Spent 1.94 s on a formula simplification. DAG size of input: 178 DAG size of output: 164 [2019-12-27 19:05:17,779 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:18,986 WARN L192 SmtUtils]: Spent 1.21 s on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 19:05:18,986 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:18,987 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2019-12-27 19:05:18,987 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2019-12-27 19:05:20,018 WARN L192 SmtUtils]: Spent 1.03 s on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 19:05:20,591 INFO L206 etLargeBlockEncoding]: Checked pairs total: 121912 [2019-12-27 19:05:20,591 INFO L214 etLargeBlockEncoding]: Total number of compositions: 436 [2019-12-27 19:05:20,594 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 121 transitions [2019-12-27 19:05:20,652 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1471 states. [2019-12-27 19:05:20,654 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states. [2019-12-27 19:05:20,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 19:05:20,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:20,661 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 19:05:20,662 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:20,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:20,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1594, now seen corresponding path program 1 times [2019-12-27 19:05:20,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:20,679 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537298498] [2019-12-27 19:05:20,679 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:20,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:20,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:20,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537298498] [2019-12-27 19:05:20,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:20,793 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 19:05:20,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [208978160] [2019-12-27 19:05:20,795 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:20,799 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:20,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 2 states and 1 transitions. [2019-12-27 19:05:20,807 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:20,811 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:20,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 19:05:20,812 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:20,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 19:05:20,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 19:05:20,829 INFO L87 Difference]: Start difference. First operand 1471 states. Second operand 2 states. [2019-12-27 19:05:20,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:20,882 INFO L93 Difference]: Finished difference Result 1470 states and 3297 transitions. [2019-12-27 19:05:20,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 19:05:20,885 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 19:05:20,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:20,926 INFO L225 Difference]: With dead ends: 1470 [2019-12-27 19:05:20,926 INFO L226 Difference]: Without dead ends: 1469 [2019-12-27 19:05:20,927 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 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-12-27 19:05:20,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-12-27 19:05:21,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2019-12-27 19:05:21,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1469 states. [2019-12-27 19:05:21,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 3296 transitions. [2019-12-27 19:05:21,064 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 3296 transitions. Word has length 1 [2019-12-27 19:05:21,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:21,064 INFO L462 AbstractCegarLoop]: Abstraction has 1469 states and 3296 transitions. [2019-12-27 19:05:21,064 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 19:05:21,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 3296 transitions. [2019-12-27 19:05:21,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 19:05:21,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:21,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 19:05:21,065 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:21,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:21,065 INFO L82 PathProgramCache]: Analyzing trace with hash -508671536, now seen corresponding path program 1 times [2019-12-27 19:05:21,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:21,066 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244945013] [2019-12-27 19:05:21,066 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:21,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:21,201 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244945013] [2019-12-27 19:05:21,201 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:21,201 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:05:21,202 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [309507276] [2019-12-27 19:05:21,202 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:21,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:21,205 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 7 states and 6 transitions. [2019-12-27 19:05:21,205 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:21,205 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:21,206 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:05:21,207 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:21,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:05:21,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:05:21,210 INFO L87 Difference]: Start difference. First operand 1469 states and 3296 transitions. Second operand 3 states. [2019-12-27 19:05:21,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:21,295 INFO L93 Difference]: Finished difference Result 2761 states and 6206 transitions. [2019-12-27 19:05:21,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:05:21,295 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 19:05:21,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:21,313 INFO L225 Difference]: With dead ends: 2761 [2019-12-27 19:05:21,313 INFO L226 Difference]: Without dead ends: 2761 [2019-12-27 19:05:21,314 INFO L631 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-12-27 19:05:21,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2761 states. [2019-12-27 19:05:21,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2761 to 1488. [2019-12-27 19:05:21,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-27 19:05:21,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3336 transitions. [2019-12-27 19:05:21,370 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3336 transitions. Word has length 6 [2019-12-27 19:05:21,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:21,370 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 3336 transitions. [2019-12-27 19:05:21,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:05:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3336 transitions. [2019-12-27 19:05:21,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 19:05:21,371 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:21,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:21,372 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:21,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:21,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1410435842, now seen corresponding path program 1 times [2019-12-27 19:05:21,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:21,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268209660] [2019-12-27 19:05:21,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:21,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:21,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:21,440 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268209660] [2019-12-27 19:05:21,440 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:21,440 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 19:05:21,440 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2124341904] [2019-12-27 19:05:21,440 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:21,441 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:21,442 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 19:05:21,442 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:21,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:21,442 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:05:21,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:21,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:05:21,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:05:21,443 INFO L87 Difference]: Start difference. First operand 1488 states and 3336 transitions. Second operand 3 states. [2019-12-27 19:05:21,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:21,460 INFO L93 Difference]: Finished difference Result 1488 states and 3317 transitions. [2019-12-27 19:05:21,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:05:21,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 19:05:21,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:21,469 INFO L225 Difference]: With dead ends: 1488 [2019-12-27 19:05:21,469 INFO L226 Difference]: Without dead ends: 1488 [2019-12-27 19:05:21,470 INFO L631 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-12-27 19:05:21,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1488 states. [2019-12-27 19:05:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1488 to 1488. [2019-12-27 19:05:21,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1488 states. [2019-12-27 19:05:21,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1488 states to 1488 states and 3317 transitions. [2019-12-27 19:05:21,508 INFO L78 Accepts]: Start accepts. Automaton has 1488 states and 3317 transitions. Word has length 7 [2019-12-27 19:05:21,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:21,509 INFO L462 AbstractCegarLoop]: Abstraction has 1488 states and 3317 transitions. [2019-12-27 19:05:21,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:05:21,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1488 states and 3317 transitions. [2019-12-27 19:05:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 19:05:21,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:21,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:21,510 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:21,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:21,511 INFO L82 PathProgramCache]: Analyzing trace with hash 785876213, now seen corresponding path program 1 times [2019-12-27 19:05:21,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:21,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825030484] [2019-12-27 19:05:21,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:21,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:21,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:21,671 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825030484] [2019-12-27 19:05:21,671 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:21,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 19:05:21,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1760247137] [2019-12-27 19:05:21,672 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:21,673 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:21,674 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 9 states and 8 transitions. [2019-12-27 19:05:21,674 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:21,675 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:21,675 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 19:05:21,675 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:21,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 19:05:21,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 19:05:21,676 INFO L87 Difference]: Start difference. First operand 1488 states and 3317 transitions. Second operand 6 states. [2019-12-27 19:05:22,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:22,244 INFO L93 Difference]: Finished difference Result 1874 states and 4178 transitions. [2019-12-27 19:05:22,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 19:05:22,245 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-27 19:05:22,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:22,256 INFO L225 Difference]: With dead ends: 1874 [2019-12-27 19:05:22,256 INFO L226 Difference]: Without dead ends: 1874 [2019-12-27 19:05:22,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-27 19:05:22,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1874 states. [2019-12-27 19:05:22,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1874 to 1595. [2019-12-27 19:05:22,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 19:05:22,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3562 transitions. [2019-12-27 19:05:22,301 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3562 transitions. Word has length 8 [2019-12-27 19:05:22,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:22,302 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3562 transitions. [2019-12-27 19:05:22,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 19:05:22,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3562 transitions. [2019-12-27 19:05:22,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 19:05:22,306 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:22,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:22,306 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:22,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:22,306 INFO L82 PathProgramCache]: Analyzing trace with hash -686862126, now seen corresponding path program 1 times [2019-12-27 19:05:22,307 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:22,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327319220] [2019-12-27 19:05:22,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:22,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327319220] [2019-12-27 19:05:22,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:22,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 19:05:22,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [824027008] [2019-12-27 19:05:22,399 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:22,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:22,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 11 states and 10 transitions. [2019-12-27 19:05:22,401 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:22,402 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:22,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 19:05:22,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:22,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 19:05:22,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 19:05:22,403 INFO L87 Difference]: Start difference. First operand 1595 states and 3562 transitions. Second operand 3 states. [2019-12-27 19:05:22,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:22,464 INFO L93 Difference]: Finished difference Result 2622 states and 5848 transitions. [2019-12-27 19:05:22,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 19:05:22,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 19:05:22,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:22,479 INFO L225 Difference]: With dead ends: 2622 [2019-12-27 19:05:22,480 INFO L226 Difference]: Without dead ends: 2622 [2019-12-27 19:05:22,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-12-27 19:05:22,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2622 states. [2019-12-27 19:05:22,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2622 to 1652. [2019-12-27 19:05:22,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1652 states. [2019-12-27 19:05:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 3682 transitions. [2019-12-27 19:05:22,531 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 3682 transitions. Word has length 10 [2019-12-27 19:05:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:22,531 INFO L462 AbstractCegarLoop]: Abstraction has 1652 states and 3682 transitions. [2019-12-27 19:05:22,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 19:05:22,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 3682 transitions. [2019-12-27 19:05:22,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:05:22,533 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:22,533 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:22,534 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:22,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:22,534 INFO L82 PathProgramCache]: Analyzing trace with hash 1466806361, now seen corresponding path program 1 times [2019-12-27 19:05:22,534 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:22,535 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819761924] [2019-12-27 19:05:22,535 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:22,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:22,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:22,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819761924] [2019-12-27 19:05:22,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:22,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 19:05:22,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [957545952] [2019-12-27 19:05:22,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:22,767 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:22,771 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 27 states and 38 transitions. [2019-12-27 19:05:22,771 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:22,779 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:05:22,784 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:05:22,784 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:05:22,785 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2019-12-27 19:05:23,038 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 19:05:23,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 19:05:23,039 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 19:05:23,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-27 19:05:23,040 INFO L87 Difference]: Start difference. First operand 1652 states and 3682 transitions. Second operand 17 states. [2019-12-27 19:05:28,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:28,775 INFO L93 Difference]: Finished difference Result 2171 states and 4725 transitions. [2019-12-27 19:05:28,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 19:05:28,776 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 14 [2019-12-27 19:05:28,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:28,788 INFO L225 Difference]: With dead ends: 2171 [2019-12-27 19:05:28,789 INFO L226 Difference]: Without dead ends: 2171 [2019-12-27 19:05:28,790 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=366, Invalid=966, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 19:05:28,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2171 states. [2019-12-27 19:05:28,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2171 to 1661. [2019-12-27 19:05:28,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1661 states. [2019-12-27 19:05:28,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1661 states to 1661 states and 3702 transitions. [2019-12-27 19:05:28,845 INFO L78 Accepts]: Start accepts. Automaton has 1661 states and 3702 transitions. Word has length 14 [2019-12-27 19:05:28,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:28,845 INFO L462 AbstractCegarLoop]: Abstraction has 1661 states and 3702 transitions. [2019-12-27 19:05:28,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 19:05:28,846 INFO L276 IsEmpty]: Start isEmpty. Operand 1661 states and 3702 transitions. [2019-12-27 19:05:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 19:05:28,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:28,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:28,851 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:28,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:28,852 INFO L82 PathProgramCache]: Analyzing trace with hash -601336722, now seen corresponding path program 1 times [2019-12-27 19:05:28,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:28,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859924359] [2019-12-27 19:05:28,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:28,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:29,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:29,071 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859924359] [2019-12-27 19:05:29,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:29,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:05:29,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2144373663] [2019-12-27 19:05:29,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:29,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:29,076 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 19:05:29,077 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:29,077 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:05:29,077 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 19:05:29,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:29,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 19:05:29,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 19:05:29,078 INFO L87 Difference]: Start difference. First operand 1661 states and 3702 transitions. Second operand 8 states. [2019-12-27 19:05:30,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:30,161 INFO L93 Difference]: Finished difference Result 2488 states and 5511 transitions. [2019-12-27 19:05:30,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 19:05:30,162 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-27 19:05:30,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:30,173 INFO L225 Difference]: With dead ends: 2488 [2019-12-27 19:05:30,173 INFO L226 Difference]: Without dead ends: 2402 [2019-12-27 19:05:30,173 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2019-12-27 19:05:30,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2402 states. [2019-12-27 19:05:30,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2402 to 1819. [2019-12-27 19:05:30,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1819 states. [2019-12-27 19:05:30,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1819 states to 1819 states and 4102 transitions. [2019-12-27 19:05:30,218 INFO L78 Accepts]: Start accepts. Automaton has 1819 states and 4102 transitions. Word has length 14 [2019-12-27 19:05:30,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:30,219 INFO L462 AbstractCegarLoop]: Abstraction has 1819 states and 4102 transitions. [2019-12-27 19:05:30,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 19:05:30,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1819 states and 4102 transitions. [2019-12-27 19:05:30,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:05:30,220 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:30,220 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:30,220 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:30,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:30,221 INFO L82 PathProgramCache]: Analyzing trace with hash -829007579, now seen corresponding path program 1 times [2019-12-27 19:05:30,221 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:30,221 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921152944] [2019-12-27 19:05:30,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:30,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921152944] [2019-12-27 19:05:30,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:30,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 19:05:30,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [694876981] [2019-12-27 19:05:30,393 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:30,395 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:30,401 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 40 states and 63 transitions. [2019-12-27 19:05:30,402 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:30,809 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:05:30,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 19:05:30,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:30,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 19:05:30,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=328, Unknown=0, NotChecked=0, Total=380 [2019-12-27 19:05:30,811 INFO L87 Difference]: Start difference. First operand 1819 states and 4102 transitions. Second operand 20 states. [2019-12-27 19:05:31,371 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2019-12-27 19:05:32,004 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 81 [2019-12-27 19:05:32,256 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 77 [2019-12-27 19:05:32,506 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 39 [2019-12-27 19:05:32,682 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 72 [2019-12-27 19:05:32,909 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 91 [2019-12-27 19:05:33,252 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2019-12-27 19:05:33,797 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 85 [2019-12-27 19:05:34,261 WARN L192 SmtUtils]: Spent 413.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 113 [2019-12-27 19:05:34,439 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2019-12-27 19:05:34,734 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 49 [2019-12-27 19:05:34,905 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 62 [2019-12-27 19:05:35,300 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 106 [2019-12-27 19:05:35,466 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 72 [2019-12-27 19:05:35,923 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 81 [2019-12-27 19:05:40,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:05:40,791 INFO L93 Difference]: Finished difference Result 2552 states and 5611 transitions. [2019-12-27 19:05:40,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 19:05:40,791 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 15 [2019-12-27 19:05:40,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:05:40,802 INFO L225 Difference]: With dead ends: 2552 [2019-12-27 19:05:40,803 INFO L226 Difference]: Without dead ends: 2552 [2019-12-27 19:05:40,803 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 365 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 19:05:40,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states. [2019-12-27 19:05:40,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 1944. [2019-12-27 19:05:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1944 states. [2019-12-27 19:05:40,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1944 states to 1944 states and 4393 transitions. [2019-12-27 19:05:40,848 INFO L78 Accepts]: Start accepts. Automaton has 1944 states and 4393 transitions. Word has length 15 [2019-12-27 19:05:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:05:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 1944 states and 4393 transitions. [2019-12-27 19:05:40,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 19:05:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 1944 states and 4393 transitions. [2019-12-27 19:05:40,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:05:40,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:05:40,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:05:40,852 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:05:40,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:05:40,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1050721063, now seen corresponding path program 2 times [2019-12-27 19:05:40,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:05:40,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1176113416] [2019-12-27 19:05:40,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:05:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:05:41,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:05:41,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1176113416] [2019-12-27 19:05:41,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:05:41,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:05:41,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [632612257] [2019-12-27 19:05:41,400 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:05:41,402 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:05:41,407 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 34 states and 51 transitions. [2019-12-27 19:05:41,407 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:05:42,140 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 19:05:42,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-12-27 19:05:42,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:05:42,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-12-27 19:05:42,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2019-12-27 19:05:42,142 INFO L87 Difference]: Start difference. First operand 1944 states and 4393 transitions. Second operand 26 states. [2019-12-27 19:05:42,670 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 59 [2019-12-27 19:05:42,823 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-12-27 19:05:43,020 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 64 [2019-12-27 19:05:43,227 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-12-27 19:05:43,442 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 61 [2019-12-27 19:05:43,816 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 90 [2019-12-27 19:05:44,065 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 86 [2019-12-27 19:05:44,314 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 80 [2019-12-27 19:05:44,608 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 48 [2019-12-27 19:05:44,916 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 96 [2019-12-27 19:05:45,268 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 101 [2019-12-27 19:05:45,552 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 59 [2019-12-27 19:05:45,953 WARN L192 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 108 [2019-12-27 19:05:46,390 WARN L192 SmtUtils]: Spent 353.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 113 [2019-12-27 19:05:46,711 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 68 [2019-12-27 19:05:47,150 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 84 [2019-12-27 19:05:47,576 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2019-12-27 19:05:47,964 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 67 [2019-12-27 19:05:48,148 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 67 [2019-12-27 19:05:48,325 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 50 [2019-12-27 19:05:48,827 WARN L192 SmtUtils]: Spent 188.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 89 [2019-12-27 19:05:49,090 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 76 [2019-12-27 19:05:49,349 WARN L192 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 93 [2019-12-27 19:05:49,937 WARN L192 SmtUtils]: Spent 251.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 99 [2019-12-27 19:05:50,325 WARN L192 SmtUtils]: Spent 311.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 102 [2019-12-27 19:05:51,011 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 61 [2019-12-27 19:05:51,434 WARN L192 SmtUtils]: Spent 321.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 111 [2019-12-27 19:05:51,908 WARN L192 SmtUtils]: Spent 385.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 107 [2019-12-27 19:05:52,375 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 71 [2019-12-27 19:05:53,046 WARN L192 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 80 [2019-12-27 19:05:53,402 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 53 [2019-12-27 19:05:59,234 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 68 [2019-12-27 19:06:00,088 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 64 [2019-12-27 19:06:01,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:01,589 INFO L93 Difference]: Finished difference Result 2996 states and 6484 transitions. [2019-12-27 19:06:01,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 19:06:01,590 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 15 [2019-12-27 19:06:01,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:01,604 INFO L225 Difference]: With dead ends: 2996 [2019-12-27 19:06:01,605 INFO L226 Difference]: Without dead ends: 2996 [2019-12-27 19:06:01,606 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1001 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1023, Invalid=3533, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 19:06:01,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2996 states. [2019-12-27 19:06:01,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2996 to 1936. [2019-12-27 19:06:01,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1936 states. [2019-12-27 19:06:01,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1936 states to 1936 states and 4370 transitions. [2019-12-27 19:06:01,649 INFO L78 Accepts]: Start accepts. Automaton has 1936 states and 4370 transitions. Word has length 15 [2019-12-27 19:06:01,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:01,650 INFO L462 AbstractCegarLoop]: Abstraction has 1936 states and 4370 transitions. [2019-12-27 19:06:01,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-12-27 19:06:01,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1936 states and 4370 transitions. [2019-12-27 19:06:01,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:06:01,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:01,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:01,651 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:01,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:01,652 INFO L82 PathProgramCache]: Analyzing trace with hash -1426717529, now seen corresponding path program 3 times [2019-12-27 19:06:01,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:01,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696822989] [2019-12-27 19:06:01,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:01,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:01,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:06:01,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696822989] [2019-12-27 19:06:01,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:01,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 19:06:01,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [64361932] [2019-12-27 19:06:01,915 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:01,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:01,921 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 43 transitions. [2019-12-27 19:06:01,922 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:02,275 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:06:02,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-27 19:06:02,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:02,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-27 19:06:02,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2019-12-27 19:06:02,277 INFO L87 Difference]: Start difference. First operand 1936 states and 4370 transitions. Second operand 23 states. [2019-12-27 19:06:03,361 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 55 [2019-12-27 19:06:03,751 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 73 [2019-12-27 19:06:04,285 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 48 [2019-12-27 19:06:04,543 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 85 [2019-12-27 19:06:04,762 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 75 [2019-12-27 19:06:05,241 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 87 [2019-12-27 19:06:05,419 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 48 [2019-12-27 19:06:05,794 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 54 [2019-12-27 19:06:05,986 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 50 [2019-12-27 19:06:06,549 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 56 [2019-12-27 19:06:07,324 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 55 [2019-12-27 19:06:07,640 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 51 [2019-12-27 19:06:07,883 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 78 [2019-12-27 19:06:08,389 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 90 [2019-12-27 19:06:08,892 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 53 [2019-12-27 19:06:09,314 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 59 [2019-12-27 19:06:09,662 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 49 [2019-12-27 19:06:15,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:15,730 INFO L93 Difference]: Finished difference Result 2897 states and 6349 transitions. [2019-12-27 19:06:15,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2019-12-27 19:06:15,730 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 15 [2019-12-27 19:06:15,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:15,740 INFO L225 Difference]: With dead ends: 2897 [2019-12-27 19:06:15,741 INFO L226 Difference]: Without dead ends: 2897 [2019-12-27 19:06:15,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=981, Invalid=3441, Unknown=0, NotChecked=0, Total=4422 [2019-12-27 19:06:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2897 states. [2019-12-27 19:06:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2897 to 1940. [2019-12-27 19:06:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1940 states. [2019-12-27 19:06:15,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 4378 transitions. [2019-12-27 19:06:15,783 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 4378 transitions. Word has length 15 [2019-12-27 19:06:15,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:15,783 INFO L462 AbstractCegarLoop]: Abstraction has 1940 states and 4378 transitions. [2019-12-27 19:06:15,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-27 19:06:15,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 4378 transitions. [2019-12-27 19:06:15,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 19:06:15,784 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:15,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:15,785 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:15,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash 721588591, now seen corresponding path program 1 times [2019-12-27 19:06:15,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:15,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372338654] [2019-12-27 19:06:15,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:06:15,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372338654] [2019-12-27 19:06:15,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:15,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:06:15,925 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1242657231] [2019-12-27 19:06:15,925 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:15,926 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:15,929 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 30 states and 43 transitions. [2019-12-27 19:06:15,929 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:15,932 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:06:15,934 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:06:15,934 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:06:15,934 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:16 [2019-12-27 19:06:15,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:06:15,961 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:06:15,961 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:06:15,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:21 [2019-12-27 19:06:16,176 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 19:06:16,177 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 19:06:16,177 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:16,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 19:06:16,178 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=283, Unknown=0, NotChecked=0, Total=342 [2019-12-27 19:06:16,178 INFO L87 Difference]: Start difference. First operand 1940 states and 4378 transitions. Second operand 19 states. [2019-12-27 19:06:23,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:23,006 INFO L93 Difference]: Finished difference Result 2686 states and 5897 transitions. [2019-12-27 19:06:23,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 19:06:23,007 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 15 [2019-12-27 19:06:23,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:23,014 INFO L225 Difference]: With dead ends: 2686 [2019-12-27 19:06:23,014 INFO L226 Difference]: Without dead ends: 2686 [2019-12-27 19:06:23,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=394, Invalid=1166, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 19:06:23,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-12-27 19:06:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 1980. [2019-12-27 19:06:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1980 states. [2019-12-27 19:06:23,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1980 states to 1980 states and 4468 transitions. [2019-12-27 19:06:23,057 INFO L78 Accepts]: Start accepts. Automaton has 1980 states and 4468 transitions. Word has length 15 [2019-12-27 19:06:23,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:23,057 INFO L462 AbstractCegarLoop]: Abstraction has 1980 states and 4468 transitions. [2019-12-27 19:06:23,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 19:06:23,058 INFO L276 IsEmpty]: Start isEmpty. Operand 1980 states and 4468 transitions. [2019-12-27 19:06:23,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 19:06:23,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:23,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:23,060 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:23,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:23,060 INFO L82 PathProgramCache]: Analyzing trace with hash 830272325, now seen corresponding path program 1 times [2019-12-27 19:06:23,061 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:23,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591484293] [2019-12-27 19:06:23,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:23,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:23,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:06:23,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591484293] [2019-12-27 19:06:23,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:23,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 19:06:23,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [65275531] [2019-12-27 19:06:23,251 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:23,253 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:23,258 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 48 transitions. [2019-12-27 19:06:23,258 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:23,262 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:06:23,264 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:06:23,264 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:06:23,265 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:21 [2019-12-27 19:06:23,300 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:06:23,303 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:06:23,303 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:06:23,303 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:47, output treesize:26 [2019-12-27 19:06:23,543 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 19:06:23,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-12-27 19:06:23,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-12-27 19:06:23,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2019-12-27 19:06:23,545 INFO L87 Difference]: Start difference. First operand 1980 states and 4468 transitions. Second operand 21 states. [2019-12-27 19:06:25,268 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 65 [2019-12-27 19:06:26,105 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 68 [2019-12-27 19:06:32,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:06:32,163 INFO L93 Difference]: Finished difference Result 2791 states and 6112 transitions. [2019-12-27 19:06:32,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 19:06:32,164 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 16 [2019-12-27 19:06:32,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:06:32,170 INFO L225 Difference]: With dead ends: 2791 [2019-12-27 19:06:32,171 INFO L226 Difference]: Without dead ends: 2791 [2019-12-27 19:06:32,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=427, Invalid=1295, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 19:06:32,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2791 states. [2019-12-27 19:06:32,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2791 to 1982. [2019-12-27 19:06:32,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1982 states. [2019-12-27 19:06:32,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1982 states to 1982 states and 4474 transitions. [2019-12-27 19:06:32,211 INFO L78 Accepts]: Start accepts. Automaton has 1982 states and 4474 transitions. Word has length 16 [2019-12-27 19:06:32,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:06:32,211 INFO L462 AbstractCegarLoop]: Abstraction has 1982 states and 4474 transitions. [2019-12-27 19:06:32,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-12-27 19:06:32,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1982 states and 4474 transitions. [2019-12-27 19:06:32,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:06:32,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:06:32,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:06:32,213 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:06:32,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:06:32,214 INFO L82 PathProgramCache]: Analyzing trace with hash -845063621, now seen corresponding path program 1 times [2019-12-27 19:06:32,214 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:06:32,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [439205820] [2019-12-27 19:06:32,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:06:32,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:06:32,696 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2019-12-27 19:06:32,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:06:32,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [439205820] [2019-12-27 19:06:32,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:06:32,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:06:32,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1712449115] [2019-12-27 19:06:32,954 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:06:32,956 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:06:32,961 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 19:06:32,961 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:06:33,855 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 19:06:33,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 19:06:33,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:06:33,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 19:06:33,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=734, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:06:33,856 INFO L87 Difference]: Start difference. First operand 1982 states and 4474 transitions. Second operand 29 states. [2019-12-27 19:06:34,551 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-27 19:06:35,166 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 70 [2019-12-27 19:06:35,424 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 60 [2019-12-27 19:06:35,832 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2019-12-27 19:06:36,097 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 74 [2019-12-27 19:06:36,407 WARN L192 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 78 [2019-12-27 19:06:36,855 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 52 [2019-12-27 19:06:37,191 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2019-12-27 19:06:37,636 WARN L192 SmtUtils]: Spent 357.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 104 [2019-12-27 19:06:38,026 WARN L192 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 90 [2019-12-27 19:06:38,558 WARN L192 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 61 [2019-12-27 19:06:38,976 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 149 DAG size of output: 99 [2019-12-27 19:06:39,517 WARN L192 SmtUtils]: Spent 441.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 112 [2019-12-27 19:06:40,002 WARN L192 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 98 [2019-12-27 19:06:40,260 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 42 [2019-12-27 19:06:40,611 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2019-12-27 19:06:40,993 WARN L192 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 55 [2019-12-27 19:06:41,213 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 178 DAG size of output: 47 [2019-12-27 19:06:41,673 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 83 [2019-12-27 19:06:41,977 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 70 [2019-12-27 19:06:42,355 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 223 DAG size of output: 59 [2019-12-27 19:06:43,298 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 143 DAG size of output: 59 [2019-12-27 19:06:43,512 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-27 19:06:43,889 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-27 19:06:44,239 WARN L192 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 62 [2019-12-27 19:06:44,509 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2019-12-27 19:06:44,800 WARN L192 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2019-12-27 19:06:45,601 WARN L192 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 75 [2019-12-27 19:06:45,954 WARN L192 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 92 [2019-12-27 19:06:46,725 WARN L192 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 176 DAG size of output: 61 [2019-12-27 19:06:47,373 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 78 [2019-12-27 19:06:47,990 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 102 [2019-12-27 19:06:48,343 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 62 [2019-12-27 19:06:48,916 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 205 DAG size of output: 65 [2019-12-27 19:06:49,176 WARN L192 SmtUtils]: Spent 167.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 64 [2019-12-27 19:06:49,527 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 63 [2019-12-27 19:06:49,732 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 45 [2019-12-27 19:06:50,132 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 19:06:50,737 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 208 DAG size of output: 68 [2019-12-27 19:06:50,996 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 50 [2019-12-27 19:06:51,577 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 57 [2019-12-27 19:06:51,746 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-27 19:06:52,026 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-27 19:06:52,285 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 65 [2019-12-27 19:06:53,089 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-12-27 19:06:53,763 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-27 19:06:54,432 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2019-12-27 19:06:54,987 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 60 [2019-12-27 19:06:55,269 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-12-27 19:06:56,675 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 63 [2019-12-27 19:07:03,003 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-12-27 19:07:03,320 WARN L192 SmtUtils]: Spent 197.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 77 [2019-12-27 19:07:04,197 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 63 [2019-12-27 19:07:04,490 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 73 [2019-12-27 19:07:06,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:07:06,561 INFO L93 Difference]: Finished difference Result 4382 states and 9615 transitions. [2019-12-27 19:07:06,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2019-12-27 19:07:06,562 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 17 [2019-12-27 19:07:06,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:07:06,571 INFO L225 Difference]: With dead ends: 4382 [2019-12-27 19:07:06,571 INFO L226 Difference]: Without dead ends: 4382 [2019-12-27 19:07:06,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 17.2s TimeCoverageRelationStatistics Valid=1641, Invalid=9701, Unknown=0, NotChecked=0, Total=11342 [2019-12-27 19:07:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2019-12-27 19:07:06,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 2127. [2019-12-27 19:07:06,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-27 19:07:06,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 4837 transitions. [2019-12-27 19:07:06,627 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 4837 transitions. Word has length 17 [2019-12-27 19:07:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:07:06,629 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 4837 transitions. [2019-12-27 19:07:06,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 19:07:06,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 4837 transitions. [2019-12-27 19:07:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:07:06,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:07:06,631 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:07:06,631 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:07:06,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:07:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash -841171571, now seen corresponding path program 2 times [2019-12-27 19:07:06,632 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:07:06,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388182632] [2019-12-27 19:07:06,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:07:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:07:07,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:07:07,204 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388182632] [2019-12-27 19:07:07,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:07:07,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:07:07,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1438069705] [2019-12-27 19:07:07,204 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:07:07,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:07:07,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 55 transitions. [2019-12-27 19:07:07,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:07:08,367 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:07:08,368 INFO L442 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-12-27 19:07:08,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:07:08,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-12-27 19:07:08,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=738, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:07:08,369 INFO L87 Difference]: Start difference. First operand 2127 states and 4837 transitions. Second operand 29 states. [2019-12-27 19:07:09,321 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 62 [2019-12-27 19:07:09,871 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 56 [2019-12-27 19:07:10,132 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 60 [2019-12-27 19:07:10,571 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 78 [2019-12-27 19:07:10,843 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 74 [2019-12-27 19:07:11,121 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 64 [2019-12-27 19:07:11,575 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 52 [2019-12-27 19:07:11,914 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 86 [2019-12-27 19:07:12,339 WARN L192 SmtUtils]: Spent 342.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 92 [2019-12-27 19:07:12,852 WARN L192 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 61 [2019-12-27 19:07:13,277 WARN L192 SmtUtils]: Spent 286.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 101 [2019-12-27 19:07:13,754 WARN L192 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 98 [2019-12-27 19:07:14,005 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 148 DAG size of output: 42 [2019-12-27 19:07:14,327 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 60 [2019-12-27 19:07:14,704 WARN L192 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 181 DAG size of output: 55 [2019-12-27 19:07:14,954 WARN L192 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 190 DAG size of output: 62 [2019-12-27 19:07:15,182 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 180 DAG size of output: 51 [2019-12-27 19:07:15,591 WARN L192 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 70 [2019-12-27 19:07:16,013 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 226 DAG size of output: 74 [2019-12-27 19:07:16,386 WARN L192 SmtUtils]: Spent 239.00 ms on a formula simplification. DAG size of input: 216 DAG size of output: 63 [2019-12-27 19:07:17,060 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-27 19:07:17,410 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2019-12-27 19:07:17,624 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 43 [2019-12-27 19:07:17,907 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 135 DAG size of output: 77 [2019-12-27 19:07:18,204 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 81 [2019-12-27 19:07:18,856 WARN L192 SmtUtils]: Spent 245.00 ms on a formula simplification. DAG size of input: 141 DAG size of output: 94 [2019-12-27 19:07:19,620 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 134 DAG size of output: 64 [2019-12-27 19:07:20,063 WARN L192 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 104 [2019-12-27 19:07:20,703 WARN L192 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 204 DAG size of output: 64 [2019-12-27 19:07:20,906 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 45 [2019-12-27 19:07:21,188 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 63 [2019-12-27 19:07:21,615 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-12-27 19:07:22,036 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 207 DAG size of output: 67 [2019-12-27 19:07:22,328 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 193 DAG size of output: 65 [2019-12-27 19:07:22,564 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 183 DAG size of output: 54 [2019-12-27 19:07:23,008 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2019-12-27 19:07:24,367 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-12-27 19:07:25,083 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-12-27 19:07:26,205 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 47 [2019-12-27 19:07:32,579 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 71 [2019-12-27 19:07:32,893 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2019-12-27 19:07:33,700 WARN L192 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 67 [2019-12-27 19:07:34,014 WARN L192 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 77 [2019-12-27 19:07:35,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:07:35,929 INFO L93 Difference]: Finished difference Result 3976 states and 8755 transitions. [2019-12-27 19:07:35,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2019-12-27 19:07:35,929 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 17 [2019-12-27 19:07:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:07:35,936 INFO L225 Difference]: With dead ends: 3976 [2019-12-27 19:07:35,936 INFO L226 Difference]: Without dead ends: 3976 [2019-12-27 19:07:35,941 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2126 ImplicationChecksByTransitivity, 13.8s TimeCoverageRelationStatistics Valid=1241, Invalid=7131, Unknown=0, NotChecked=0, Total=8372 [2019-12-27 19:07:35,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3976 states. [2019-12-27 19:07:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3976 to 2146. [2019-12-27 19:07:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-12-27 19:07:36,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4890 transitions. [2019-12-27 19:07:36,005 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4890 transitions. Word has length 17 [2019-12-27 19:07:36,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:07:36,005 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 4890 transitions. [2019-12-27 19:07:36,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-12-27 19:07:36,006 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4890 transitions. [2019-12-27 19:07:36,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 19:07:36,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:07:36,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:07:36,007 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:07:36,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:07:36,007 INFO L82 PathProgramCache]: Analyzing trace with hash -700627515, now seen corresponding path program 3 times [2019-12-27 19:07:36,008 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:07:36,008 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498544272] [2019-12-27 19:07:36,008 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:07:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:07:36,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:07:36,412 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498544272] [2019-12-27 19:07:36,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:07:36,413 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:07:36,413 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [933121235] [2019-12-27 19:07:36,413 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:07:36,415 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:07:36,420 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 36 states and 53 transitions. [2019-12-27 19:07:36,420 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:07:36,931 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 19:07:36,932 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 19:07:36,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:07:36,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 19:07:36,933 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=660, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:07:36,933 INFO L87 Difference]: Start difference. First operand 2146 states and 4890 transitions. Second operand 28 states. [2019-12-27 19:07:37,830 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 53 [2019-12-27 19:07:38,048 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 57 [2019-12-27 19:07:38,210 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 47 [2019-12-27 19:07:38,472 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 75 [2019-12-27 19:07:39,085 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 92 [2019-12-27 19:07:39,546 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 52 [2019-12-27 19:07:39,962 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 56 [2019-12-27 19:07:40,172 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 49 [2019-12-27 19:07:40,896 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 56 [2019-12-27 19:07:41,283 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 50 [2019-12-27 19:07:41,539 WARN L192 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 157 DAG size of output: 78 [2019-12-27 19:07:42,109 WARN L192 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 95 [2019-12-27 19:07:42,885 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 55 [2019-12-27 19:07:43,137 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 46 [2019-12-27 19:07:43,363 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 59 [2019-12-27 19:07:43,796 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 150 DAG size of output: 52 [2019-12-27 19:07:49,716 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2019-12-27 19:07:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:07:52,030 INFO L93 Difference]: Finished difference Result 3795 states and 8398 transitions. [2019-12-27 19:07:52,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2019-12-27 19:07:52,030 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 17 [2019-12-27 19:07:52,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:07:52,035 INFO L225 Difference]: With dead ends: 3795 [2019-12-27 19:07:52,035 INFO L226 Difference]: Without dead ends: 3795 [2019-12-27 19:07:52,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1171 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=879, Invalid=4377, Unknown=0, NotChecked=0, Total=5256 [2019-12-27 19:07:52,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3795 states. [2019-12-27 19:07:52,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3795 to 2136. [2019-12-27 19:07:52,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2136 states. [2019-12-27 19:07:52,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2136 states to 2136 states and 4854 transitions. [2019-12-27 19:07:52,073 INFO L78 Accepts]: Start accepts. Automaton has 2136 states and 4854 transitions. Word has length 17 [2019-12-27 19:07:52,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:07:52,074 INFO L462 AbstractCegarLoop]: Abstraction has 2136 states and 4854 transitions. [2019-12-27 19:07:52,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 19:07:52,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2136 states and 4854 transitions. [2019-12-27 19:07:52,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:07:52,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:07:52,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:07:52,076 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:07:52,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:07:52,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1173173304, now seen corresponding path program 1 times [2019-12-27 19:07:52,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:07:52,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692612160] [2019-12-27 19:07:52,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:07:52,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:07:52,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:07:52,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692612160] [2019-12-27 19:07:52,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:07:52,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:07:52,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1342863754] [2019-12-27 19:07:52,336 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:07:52,339 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:07:52,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 58 transitions. [2019-12-27 19:07:52,345 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:07:52,347 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_2735|], 2=[|v_#memory_$Pointer$.base_2735|]} [2019-12-27 19:07:52,348 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:52,353 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:52,354 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:07:52,357 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:52,357 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:07:52,358 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:16 [2019-12-27 19:07:52,417 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:52,420 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:52,421 INFO L534 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-12-27 19:07:52,421 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:69 [2019-12-27 19:07:52,477 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:52,480 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:52,481 INFO L534 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-12-27 19:07:52,481 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:103, output treesize:86 [2019-12-27 19:07:52,523 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:07:52,526 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:07:52,526 INFO L534 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-12-27 19:07:52,527 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:134, output treesize:113 [2019-12-27 19:07:52,899 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 19:07:52,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-12-27 19:07:52,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:07:52,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-12-27 19:07:52,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-12-27 19:07:52,900 INFO L87 Difference]: Start difference. First operand 2136 states and 4854 transitions. Second operand 25 states. [2019-12-27 19:07:55,199 WARN L192 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 97 [2019-12-27 19:07:55,933 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 104 [2019-12-27 19:07:56,450 WARN L192 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 116 [2019-12-27 19:07:57,081 WARN L192 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 128 [2019-12-27 19:07:57,363 WARN L192 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 118 [2019-12-27 19:07:57,630 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 107 [2019-12-27 19:07:58,298 WARN L192 SmtUtils]: Spent 201.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 130 [2019-12-27 19:07:58,964 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 155 DAG size of output: 121 [2019-12-27 19:07:59,628 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 167 DAG size of output: 133 [2019-12-27 19:07:59,886 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-12-27 19:08:06,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:06,445 INFO L93 Difference]: Finished difference Result 2881 states and 6357 transitions. [2019-12-27 19:08:06,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 19:08:06,446 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 18 [2019-12-27 19:08:06,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:06,450 INFO L225 Difference]: With dead ends: 2881 [2019-12-27 19:08:06,450 INFO L226 Difference]: Without dead ends: 2881 [2019-12-27 19:08:06,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=784, Invalid=2296, Unknown=0, NotChecked=0, Total=3080 [2019-12-27 19:08:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2019-12-27 19:08:06,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2175. [2019-12-27 19:08:06,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2175 states. [2019-12-27 19:08:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2175 states to 2175 states and 4944 transitions. [2019-12-27 19:08:06,485 INFO L78 Accepts]: Start accepts. Automaton has 2175 states and 4944 transitions. Word has length 18 [2019-12-27 19:08:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:06,486 INFO L462 AbstractCegarLoop]: Abstraction has 2175 states and 4944 transitions. [2019-12-27 19:08:06,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-12-27 19:08:06,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2175 states and 4944 transitions. [2019-12-27 19:08:06,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 19:08:06,488 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:06,488 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:08:06,488 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:06,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:06,488 INFO L82 PathProgramCache]: Analyzing trace with hash 1008618398, now seen corresponding path program 1 times [2019-12-27 19:08:06,489 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:06,489 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680454115] [2019-12-27 19:08:06,489 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:06,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:08:06,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680454115] [2019-12-27 19:08:06,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:06,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 19:08:06,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [188651647] [2019-12-27 19:08:06,783 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:06,786 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:06,791 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 19 states and 18 transitions. [2019-12-27 19:08:06,791 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:06,792 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 19:08:06,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 19:08:06,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:06,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 19:08:06,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 19:08:06,793 INFO L87 Difference]: Start difference. First operand 2175 states and 4944 transitions. Second operand 15 states. [2019-12-27 19:08:07,546 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-27 19:08:10,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:10,056 INFO L93 Difference]: Finished difference Result 3633 states and 8165 transitions. [2019-12-27 19:08:10,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 19:08:10,057 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 19:08:10,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:10,062 INFO L225 Difference]: With dead ends: 3633 [2019-12-27 19:08:10,062 INFO L226 Difference]: Without dead ends: 3633 [2019-12-27 19:08:10,063 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=210, Invalid=602, Unknown=0, NotChecked=0, Total=812 [2019-12-27 19:08:10,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3633 states. [2019-12-27 19:08:10,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3633 to 2221. [2019-12-27 19:08:10,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2221 states. [2019-12-27 19:08:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2221 states to 2221 states and 5041 transitions. [2019-12-27 19:08:10,092 INFO L78 Accepts]: Start accepts. Automaton has 2221 states and 5041 transitions. Word has length 18 [2019-12-27 19:08:10,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:10,092 INFO L462 AbstractCegarLoop]: Abstraction has 2221 states and 5041 transitions. [2019-12-27 19:08:10,092 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 19:08:10,092 INFO L276 IsEmpty]: Start isEmpty. Operand 2221 states and 5041 transitions. [2019-12-27 19:08:10,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:08:10,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:10,094 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:08:10,094 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:10,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:10,094 INFO L82 PathProgramCache]: Analyzing trace with hash 1724295586, now seen corresponding path program 1 times [2019-12-27 19:08:10,094 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:10,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047586963] [2019-12-27 19:08:10,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:10,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:10,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:08:10,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047586963] [2019-12-27 19:08:10,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:10,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 19:08:10,557 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1546839290] [2019-12-27 19:08:10,557 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:10,560 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:10,568 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 60 transitions. [2019-12-27 19:08:10,568 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:11,276 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 19:08:11,277 INFO L442 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-12-27 19:08:11,277 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:11,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-12-27 19:08:11,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2019-12-27 19:08:11,278 INFO L87 Difference]: Start difference. First operand 2221 states and 5041 transitions. Second operand 28 states. [2019-12-27 19:08:11,926 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 51 [2019-12-27 19:08:12,572 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 50 [2019-12-27 19:08:12,941 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 54 [2019-12-27 19:08:13,187 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 60 [2019-12-27 19:08:13,396 WARN L192 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 46 [2019-12-27 19:08:13,867 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 40 [2019-12-27 19:08:14,126 WARN L192 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 75 [2019-12-27 19:08:14,444 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 69 [2019-12-27 19:08:14,882 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 49 [2019-12-27 19:08:15,226 WARN L192 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 76 [2019-12-27 19:08:15,663 WARN L192 SmtUtils]: Spent 358.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 84 [2019-12-27 19:08:15,902 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 125 DAG size of output: 42 [2019-12-27 19:08:16,588 WARN L192 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 44 [2019-12-27 19:08:16,779 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 47 [2019-12-27 19:08:17,056 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 116 DAG size of output: 40 [2019-12-27 19:08:17,333 WARN L192 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 53 [2019-12-27 19:08:17,622 WARN L192 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 49 [2019-12-27 19:08:18,335 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2019-12-27 19:08:19,342 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 51 [2019-12-27 19:08:27,672 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 69 [2019-12-27 19:08:27,919 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-12-27 19:08:28,652 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-12-27 19:08:28,894 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-27 19:08:29,980 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 61 [2019-12-27 19:08:30,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 19:08:30,798 INFO L93 Difference]: Finished difference Result 3313 states and 7202 transitions. [2019-12-27 19:08:30,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-12-27 19:08:30,799 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 20 [2019-12-27 19:08:30,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 19:08:30,803 INFO L225 Difference]: With dead ends: 3313 [2019-12-27 19:08:30,803 INFO L226 Difference]: Without dead ends: 3313 [2019-12-27 19:08:30,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 957 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=700, Invalid=4130, Unknown=0, NotChecked=0, Total=4830 [2019-12-27 19:08:30,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3313 states. [2019-12-27 19:08:30,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3313 to 2432. [2019-12-27 19:08:30,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2432 states. [2019-12-27 19:08:30,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2432 states to 2432 states and 5506 transitions. [2019-12-27 19:08:30,831 INFO L78 Accepts]: Start accepts. Automaton has 2432 states and 5506 transitions. Word has length 20 [2019-12-27 19:08:30,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 19:08:30,831 INFO L462 AbstractCegarLoop]: Abstraction has 2432 states and 5506 transitions. [2019-12-27 19:08:30,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-12-27 19:08:30,831 INFO L276 IsEmpty]: Start isEmpty. Operand 2432 states and 5506 transitions. [2019-12-27 19:08:30,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 19:08:30,833 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 19:08:30,833 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 19:08:30,833 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 19:08:30,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 19:08:30,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1788531110, now seen corresponding path program 1 times [2019-12-27 19:08:30,834 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 19:08:30,834 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228905372] [2019-12-27 19:08:30,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 19:08:30,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 19:08:31,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 19:08:31,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228905372] [2019-12-27 19:08:31,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 19:08:31,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 19:08:31,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831177317] [2019-12-27 19:08:31,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 19:08:31,250 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 19:08:31,263 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 45 states and 68 transitions. [2019-12-27 19:08:31,263 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 19:08:31,267 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:08:31,270 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:08:31,270 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-27 19:08:31,270 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:39, output treesize:18 [2019-12-27 19:08:31,310 INFO L430 ElimStorePlain]: Different costs {0=[|v_#memory_$Pointer$.offset_2740|], 2=[|v_#memory_$Pointer$.base_2740|]} [2019-12-27 19:08:31,312 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:08:31,321 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:08:31,323 INFO L534 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:08:31,325 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:08:31,325 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-27 19:08:31,325 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:41, output treesize:16 [2019-12-27 19:08:31,405 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:08:31,408 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:08:31,408 INFO L534 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-12-27 19:08:31,408 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:90, output treesize:69 [2019-12-27 19:08:31,462 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:08:31,465 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:08:31,465 INFO L534 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-12-27 19:08:31,465 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:103, output treesize:86 [2019-12-27 19:08:31,505 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-27 19:08:31,507 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 19:08:31,508 INFO L534 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-12-27 19:08:31,508 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:134, output treesize:113 [2019-12-27 19:08:31,861 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 12 times. [2019-12-27 19:08:31,861 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-12-27 19:08:31,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 19:08:31,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-12-27 19:08:31,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-12-27 19:08:31,863 INFO L87 Difference]: Start difference. First operand 2432 states and 5506 transitions. Second operand 27 states. [2019-12-27 19:08:34,196 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 96 [2019-12-27 19:08:35,041 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 103 [2019-12-27 19:08:35,726 WARN L192 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 124 [2019-12-27 19:08:36,077 WARN L192 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 117 [2019-12-27 19:08:36,752 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 136 [2019-12-27 19:08:37,093 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 126 [2019-12-27 19:08:37,420 WARN L192 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 129 [2019-12-27 19:08:37,724 WARN L192 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 153 DAG size of output: 119 [2019-12-27 19:08:38,003 WARN L192 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 132 DAG size of output: 106 [2019-12-27 19:08:38,509 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2019-12-27 19:08:38,972 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 172 DAG size of output: 138 [2019-12-27 19:08:39,203 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 90 [2019-12-27 19:08:39,573 WARN L192 SmtUtils]: Spent 249.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 131 [2019-12-27 19:08:40,184 WARN L192 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 101 [2019-12-27 19:08:40,614 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 129 [2019-12-27 19:08:40,820 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 92 [2019-12-27 19:08:41,160 WARN L192 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 156 DAG size of output: 122 [2019-12-27 19:08:42,156 WARN L192 SmtUtils]: Spent 281.00 ms on a formula simplification. DAG size of input: 175 DAG size of output: 141 [2019-12-27 19:08:42,595 WARN L192 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 134 [2019-12-27 19:08:42,896 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 90 [2019-12-27 19:08:43,521 WARN L192 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 120 DAG size of output: 104 Received shutdown request... [2019-12-27 19:08:43,739 WARN L209 SmtUtils]: Removed 13 from assertion stack [2019-12-27 19:08:43,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-12-27 19:08:43,740 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 19:08:43,743 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 19:08:43,743 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:08:43 BasicIcfg [2019-12-27 19:08:43,743 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 19:08:43,744 INFO L168 Benchmark]: Toolchain (without parser) took 259233.85 ms. Allocated memory was 145.8 MB in the beginning and 380.1 MB in the end (delta: 234.4 MB). Free memory was 101.9 MB in the beginning and 164.9 MB in the end (delta: -63.0 MB). Peak memory consumption was 171.3 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:43,745 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 19:08:43,745 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1025.89 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 132.3 MB in the end (delta: -30.6 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:43,745 INFO L168 Benchmark]: Boogie Procedure Inliner took 144.54 ms. Allocated memory is still 203.4 MB. Free memory was 132.3 MB in the beginning and 128.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:43,745 INFO L168 Benchmark]: Boogie Preprocessor took 114.39 ms. Allocated memory is still 203.4 MB. Free memory was 128.3 MB in the beginning and 124.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:43,746 INFO L168 Benchmark]: RCFGBuilder took 1241.87 ms. Allocated memory was 203.4 MB in the beginning and 236.5 MB in the end (delta: 33.0 MB). Free memory was 124.3 MB in the beginning and 153.2 MB in the end (delta: -28.9 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:43,746 INFO L168 Benchmark]: TraceAbstraction took 256701.77 ms. Allocated memory was 236.5 MB in the beginning and 380.1 MB in the end (delta: 143.7 MB). Free memory was 151.8 MB in the beginning and 164.9 MB in the end (delta: -13.1 MB). Peak memory consumption was 130.6 MB. Max. memory is 7.1 GB. [2019-12-27 19:08:43,748 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1025.89 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.6 MB in the beginning and 132.3 MB in the end (delta: -30.6 MB). Peak memory consumption was 35.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 144.54 ms. Allocated memory is still 203.4 MB. Free memory was 132.3 MB in the beginning and 128.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 114.39 ms. Allocated memory is still 203.4 MB. Free memory was 128.3 MB in the beginning and 124.3 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1241.87 ms. Allocated memory was 203.4 MB in the beginning and 236.5 MB in the end (delta: 33.0 MB). Free memory was 124.3 MB in the beginning and 153.2 MB in the end (delta: -28.9 MB). Peak memory consumption was 41.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 256701.77 ms. Allocated memory was 236.5 MB in the beginning and 380.1 MB in the end (delta: 143.7 MB). Free memory was 151.8 MB in the beginning and 164.9 MB in the end (delta: -13.1 MB). Peak memory consumption was 130.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 53.3s, 426 ProgramPointsBefore, 106 ProgramPointsAfterwards, 455 TransitionsBefore, 121 TransitionsAfterwards, 31742 CoEnabledTransitionPairs, 16 FixpointIterations, 120 TrivialSequentialCompositions, 225 ConcurrentSequentialCompositions, 23 TrivialYvCompositions, 68 ConcurrentYvCompositions, 15 ChoiceCompositions, 16839 VarBasedMoverChecksPositive, 453 VarBasedMoverChecksNegative, 283 SemBasedMoverChecksPositive, 350 SemBasedMoverChecksNegative, 16 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 37.0s, 0 MoverChecksTotal, 121912 CheckedPairsTotal, 436 TotalNumberOfCompositions - TimeoutResultAtElement [Line: 1064]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1064). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2432states) and FLOYD_HOARE automaton (currently 48 states, 27 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 111 for 26ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 423 locations, 11 error locations. Result: TIMEOUT, OverallTime: 256.5s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 189.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2184 SDtfs, 15669 SDslu, 13207 SDs, 0 SdLazy, 79204 SolverSat, 1483 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 100.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 825 GetRequests, 21 SyntacticMatches, 10 SemanticMatches, 793 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11677 ImplicationChecksByTransitivity, 84.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2432occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 18 MinimizatonAttempts, 16498 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 244 ConstructedInterpolants, 0 QuantifiedInterpolants, 86701 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown