/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.epf -i ../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 04:26:49,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 04:26:49,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 04:26:49,052 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 04:26:49,053 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 04:26:49,054 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 04:26:49,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 04:26:49,057 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 04:26:49,059 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 04:26:49,059 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 04:26:49,060 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 04:26:49,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 04:26:49,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 04:26:49,063 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 04:26:49,064 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 04:26:49,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 04:26:49,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 04:26:49,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 04:26:49,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 04:26:49,070 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 04:26:49,072 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 04:26:49,073 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 04:26:49,074 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 04:26:49,075 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 04:26:49,077 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 04:26:49,077 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 04:26:49,078 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 04:26:49,078 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 04:26:49,079 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 04:26:49,080 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 04:26:49,080 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 04:26:49,081 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 04:26:49,082 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 04:26:49,083 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 04:26:49,084 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 04:26:49,084 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 04:26:49,085 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 04:26:49,085 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 04:26:49,085 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 04:26:49,086 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 04:26:49,087 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 04:26:49,087 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.epf [2019-12-27 04:26:49,101 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 04:26:49,102 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 04:26:49,103 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 04:26:49,103 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 04:26:49,103 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 04:26:49,104 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 04:26:49,104 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 04:26:49,104 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 04:26:49,104 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 04:26:49,104 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 04:26:49,105 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 04:26:49,105 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 04:26:49,105 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 04:26:49,105 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 04:26:49,105 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 04:26:49,105 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 04:26:49,106 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 04:26:49,106 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 04:26:49,106 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 04:26:49,106 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 04:26:49,107 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 04:26:49,107 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 04:26:49,107 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 04:26:49,107 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 04:26:49,107 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 04:26:49,108 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 04:26:49,108 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 04:26:49,108 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 04:26:49,108 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 04:26:49,384 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 04:26:49,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 04:26:49,408 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 04:26:49,409 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 04:26:49,410 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 04:26:49,411 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-27 04:26:49,484 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426a14c48/65919322d8064a998541617209d77ae0/FLAGf0c7eb3be [2019-12-27 04:26:50,045 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 04:26:50,046 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-divine/divinefifo_1w1r.i [2019-12-27 04:26:50,067 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426a14c48/65919322d8064a998541617209d77ae0/FLAGf0c7eb3be [2019-12-27 04:26:50,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/426a14c48/65919322d8064a998541617209d77ae0 [2019-12-27 04:26:50,310 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 04:26:50,312 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 04:26:50,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 04:26:50,314 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 04:26:50,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 04:26:50,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:26:50" (1/1) ... [2019-12-27 04:26:50,321 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a66fd12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:50, skipping insertion in model container [2019-12-27 04:26:50,321 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:26:50" (1/1) ... [2019-12-27 04:26:50,329 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 04:26:50,378 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 04:26:50,599 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 04:26:51,042 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:26:51,056 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 04:26:51,070 WARN L612 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2019-12-27 04:26:51,151 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 04:26:51,326 INFO L208 MainTranslator]: Completed translation [2019-12-27 04:26:51,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51 WrapperNode [2019-12-27 04:26:51,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 04:26:51,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 04:26:51,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 04:26:51,331 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 04:26:51,344 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,412 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 04:26:51,468 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 04:26:51,468 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 04:26:51,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 04:26:51,480 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,480 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,488 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,519 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,523 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (1/1) ... [2019-12-27 04:26:51,530 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 04:26:51,531 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 04:26:51,531 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 04:26:51,531 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 04:26:51,532 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (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 04:26:51,594 INFO L130 BoogieDeclarations]: Found specification of procedure pusher [2019-12-27 04:26:51,595 INFO L138 BoogieDeclarations]: Found implementation of procedure pusher [2019-12-27 04:26:51,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 04:26:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-27 04:26:51,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 04:26:51,597 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-27 04:26:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 04:26:51,598 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-27 04:26:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-27 04:26:51,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 04:26:51,599 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 04:26:51,601 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 04:26:52,637 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 04:26:52,637 INFO L287 CfgBuilder]: Removed 40 assume(true) statements. [2019-12-27 04:26:52,638 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:26:52 BoogieIcfgContainer [2019-12-27 04:26:52,639 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 04:26:52,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 04:26:52,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 04:26:52,643 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 04:26:52,643 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:26:50" (1/3) ... [2019-12-27 04:26:52,644 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33970a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:26:52, skipping insertion in model container [2019-12-27 04:26:52,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:26:51" (2/3) ... [2019-12-27 04:26:52,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33970a0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:26:52, skipping insertion in model container [2019-12-27 04:26:52,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:26:52" (3/3) ... [2019-12-27 04:26:52,647 INFO L109 eAbstractionObserver]: Analyzing ICFG divinefifo_1w1r.i [2019-12-27 04:26:52,657 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 04:26:52,657 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 04:26:52,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2019-12-27 04:26:52,666 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 04:26:52,710 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,710 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#in~q_.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,711 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,711 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,711 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,711 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,711 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,712 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,712 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,712 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,712 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,713 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,713 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,713 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,713 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,713 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,713 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,714 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,714 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,714 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,714 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,714 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,715 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,715 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,715 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,715 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,715 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,715 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,716 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,716 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,716 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,716 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,716 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,716 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,717 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,717 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,717 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,717 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,717 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,717 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,718 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,718 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,718 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,718 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,718 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,719 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,719 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,719 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,719 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,720 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,720 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,720 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,720 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,720 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,721 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,721 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,721 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,721 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,721 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,722 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,722 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,722 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,722 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,722 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,723 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,723 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,723 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,723 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,723 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,724 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,724 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,724 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,724 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,724 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,725 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,725 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,725 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,725 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,725 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,725 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,726 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,726 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,726 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,726 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,726 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,727 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,727 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,727 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,727 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,728 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,728 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,728 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,728 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,728 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,728 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 04:26:52,729 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 04:26:52,729 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,729 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,730 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,730 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,730 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,730 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,730 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,731 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,731 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,731 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,731 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,731 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,732 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,732 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,732 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 04:26:52,732 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 04:26:52,732 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,733 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,733 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,733 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,733 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,733 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,734 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,734 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,734 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,734 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,734 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,735 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,735 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,735 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,735 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,735 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,736 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,736 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,736 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,736 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,736 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,737 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,737 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,737 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,737 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,737 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,738 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,738 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,738 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,738 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,738 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,738 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,739 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,739 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,739 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,739 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,740 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,740 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,740 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,740 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,741 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,741 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,741 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,741 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,742 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,742 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,742 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,742 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,742 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,743 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,743 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,743 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,743 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,743 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,744 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,744 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,744 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,745 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,745 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,745 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,745 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,745 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,745 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,746 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,746 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,746 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,746 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,746 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,747 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,747 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,747 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,747 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,747 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,747 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,748 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,748 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,748 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,748 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,752 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,753 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,753 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,753 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,753 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,754 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_node_init_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,754 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~self.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,754 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 04:26:52,754 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,755 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,755 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 04:26:52,755 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,755 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,755 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,756 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,756 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,756 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,756 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,756 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,757 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~malloc22.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,757 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,757 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem25.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,757 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,758 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,758 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,758 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,758 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem24.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,759 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem28.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,759 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~pre27.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,759 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,759 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem21.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,760 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,760 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem19.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,760 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem20.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,760 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#t~pre59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,760 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q_.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,761 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~mem29.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,761 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_~q~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,761 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#t~ret23.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,761 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,761 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,762 WARN L315 ript$VariableManager]: TermVariabe |pusherThread1of1ForFork0_fifo_push_#in~self.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,762 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_node_init_~self.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,762 WARN L315 ript$VariableManager]: TermVariabe pusherThread1of1ForFork0_fifo_push_~t~0.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 04:26:52,788 INFO L249 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2019-12-27 04:26:52,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 04:26:52,822 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 04:26:52,822 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 04:26:52,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 04:26:52,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 04:26:52,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 04:26:52,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 04:26:52,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 04:26:52,856 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 415 places, 443 transitions [2019-12-27 04:26:52,857 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-27 04:26:53,069 INFO L132 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-27 04:26:53,070 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 04:26:53,130 INFO L76 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-27 04:26:53,181 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 415 places, 443 transitions [2019-12-27 04:26:53,288 INFO L132 PetriNetUnfolder]: 32/442 cut-off events. [2019-12-27 04:26:53,289 INFO L133 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2019-12-27 04:26:53,307 INFO L76 FinitePrefix]: Finished finitePrefix Result has 447 conditions, 442 events. 32/442 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1074 event pairs. 0/399 useless extension candidates. Maximal degree in co-relation 316. Up to 3 conditions per place. [2019-12-27 04:26:53,351 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 30326 [2019-12-27 04:26:53,352 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 04:26:54,901 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 04:26:54,926 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:26:54,927 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 04:26:54,928 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:69, output treesize:57 [2019-12-27 04:26:55,345 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 04:26:55,363 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:26:55,364 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 04:26:55,365 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:67, output treesize:53 [2019-12-27 04:26:57,627 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 04:26:57,645 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:26:57,646 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 04:26:57,646 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:88, output treesize:74 [2019-12-27 04:27:01,696 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:27:03,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:27:03,442 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:27:04,116 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:27:04,939 WARN L192 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 04:27:05,271 WARN L192 SmtUtils]: Spent 326.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 04:27:05,552 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 74 [2019-12-27 04:27:05,756 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 62 [2019-12-27 04:27:08,345 WARN L192 SmtUtils]: Spent 2.23 s on a formula simplification. DAG size of input: 153 DAG size of output: 145 [2019-12-27 04:27:08,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 04:27:08,367 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 04:27:08,376 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 04:27:10,442 WARN L192 SmtUtils]: Spent 2.06 s on a formula simplification that was a NOOP. DAG size: 137 [2019-12-27 04:27:10,442 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:27:10,443 INFO L534 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 8 dim-0 vars, and 2 xjuncts. [2019-12-27 04:27:10,444 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:584, output treesize:602 [2019-12-27 04:27:12,447 WARN L192 SmtUtils]: Spent 2.00 s on a formula simplification that was a NOOP. DAG size: 141 [2019-12-27 04:27:13,971 WARN L192 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 163 DAG size of output: 145 [2019-12-27 04:27:14,561 WARN L192 SmtUtils]: Spent 586.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-12-27 04:27:16,095 WARN L192 SmtUtils]: Spent 1.40 s on a formula simplification. DAG size of input: 181 DAG size of output: 175 [2019-12-27 04:27:16,122 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 04:27:16,694 WARN L192 SmtUtils]: Spent 570.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 04:27:16,696 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-27 04:27:16,697 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 04:27:16,698 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:452, output treesize:494 [2019-12-27 04:27:17,333 WARN L192 SmtUtils]: Spent 634.00 ms on a formula simplification that was a NOOP. DAG size: 139 [2019-12-27 04:27:17,862 INFO L206 etLargeBlockEncoding]: Checked pairs total: 106197 [2019-12-27 04:27:17,862 INFO L214 etLargeBlockEncoding]: Total number of compositions: 458 [2019-12-27 04:27:17,866 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 103 places, 121 transitions [2019-12-27 04:27:17,927 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 1414 states. [2019-12-27 04:27:17,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1414 states. [2019-12-27 04:27:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2019-12-27 04:27:17,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:17,937 INFO L411 BasicCegarLoop]: trace histogram [1] [2019-12-27 04:27:17,938 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 04:27:17,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:17,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1581, now seen corresponding path program 1 times [2019-12-27 04:27:17,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:17,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738332473] [2019-12-27 04:27:17,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:18,089 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 04:27:18,089 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738332473] [2019-12-27 04:27:18,090 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:18,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2019-12-27 04:27:18,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800321028] [2019-12-27 04:27:18,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-12-27 04:27:18,097 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:18,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-12-27 04:27:18,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-12-27 04:27:18,114 INFO L87 Difference]: Start difference. First operand 1414 states. Second operand 2 states. [2019-12-27 04:27:18,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:18,175 INFO L93 Difference]: Finished difference Result 1413 states and 3158 transitions. [2019-12-27 04:27:18,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-12-27 04:27:18,177 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 1 [2019-12-27 04:27:18,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:18,206 INFO L225 Difference]: With dead ends: 1413 [2019-12-27 04:27:18,206 INFO L226 Difference]: Without dead ends: 1412 [2019-12-27 04:27:18,207 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 04:27:18,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1412 states. [2019-12-27 04:27:18,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1412 to 1412. [2019-12-27 04:27:18,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1412 states. [2019-12-27 04:27:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1412 states to 1412 states and 3157 transitions. [2019-12-27 04:27:18,359 INFO L78 Accepts]: Start accepts. Automaton has 1412 states and 3157 transitions. Word has length 1 [2019-12-27 04:27:18,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:18,360 INFO L462 AbstractCegarLoop]: Abstraction has 1412 states and 3157 transitions. [2019-12-27 04:27:18,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-12-27 04:27:18,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1412 states and 3157 transitions. [2019-12-27 04:27:18,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-12-27 04:27:18,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:18,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2019-12-27 04:27:18,362 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 04:27:18,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:18,362 INFO L82 PathProgramCache]: Analyzing trace with hash -965036191, now seen corresponding path program 1 times [2019-12-27 04:27:18,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:18,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062343008] [2019-12-27 04:27:18,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:18,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:18,477 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 04:27:18,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062343008] [2019-12-27 04:27:18,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:18,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:27:18,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929704068] [2019-12-27 04:27:18,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:27:18,480 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:18,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:27:18,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:27:18,481 INFO L87 Difference]: Start difference. First operand 1412 states and 3157 transitions. Second operand 3 states. [2019-12-27 04:27:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:18,569 INFO L93 Difference]: Finished difference Result 2647 states and 5928 transitions. [2019-12-27 04:27:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:27:18,570 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 6 [2019-12-27 04:27:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:18,592 INFO L225 Difference]: With dead ends: 2647 [2019-12-27 04:27:18,593 INFO L226 Difference]: Without dead ends: 2647 [2019-12-27 04:27:18,597 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 04:27:18,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-12-27 04:27:18,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1431. [2019-12-27 04:27:18,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-27 04:27:18,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3197 transitions. [2019-12-27 04:27:18,654 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3197 transitions. Word has length 6 [2019-12-27 04:27:18,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:18,655 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3197 transitions. [2019-12-27 04:27:18,655 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:27:18,655 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3197 transitions. [2019-12-27 04:27:18,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 04:27:18,655 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:18,656 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:18,656 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 04:27:18,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:18,656 INFO L82 PathProgramCache]: Analyzing trace with hash 146313941, now seen corresponding path program 1 times [2019-12-27 04:27:18,656 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:18,657 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712209808] [2019-12-27 04:27:18,657 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:18,789 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 04:27:18,790 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712209808] [2019-12-27 04:27:18,790 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:18,790 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 04:27:18,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496859196] [2019-12-27 04:27:18,791 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:27:18,791 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:18,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:27:18,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:27:18,792 INFO L87 Difference]: Start difference. First operand 1431 states and 3197 transitions. Second operand 3 states. [2019-12-27 04:27:18,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:18,807 INFO L93 Difference]: Finished difference Result 1431 states and 3178 transitions. [2019-12-27 04:27:18,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:27:18,807 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 04:27:18,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:18,816 INFO L225 Difference]: With dead ends: 1431 [2019-12-27 04:27:18,816 INFO L226 Difference]: Without dead ends: 1431 [2019-12-27 04:27:18,817 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 04:27:18,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1431 states. [2019-12-27 04:27:18,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1431 to 1431. [2019-12-27 04:27:18,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1431 states. [2019-12-27 04:27:18,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1431 states to 1431 states and 3178 transitions. [2019-12-27 04:27:18,856 INFO L78 Accepts]: Start accepts. Automaton has 1431 states and 3178 transitions. Word has length 7 [2019-12-27 04:27:18,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:18,856 INFO L462 AbstractCegarLoop]: Abstraction has 1431 states and 3178 transitions. [2019-12-27 04:27:18,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:27:18,856 INFO L276 IsEmpty]: Start isEmpty. Operand 1431 states and 3178 transitions. [2019-12-27 04:27:18,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-27 04:27:18,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:18,858 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:18,858 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 04:27:18,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:18,858 INFO L82 PathProgramCache]: Analyzing trace with hash 246365665, now seen corresponding path program 1 times [2019-12-27 04:27:18,859 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:18,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416369764] [2019-12-27 04:27:18,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:18,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:19,015 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 04:27:19,016 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416369764] [2019-12-27 04:27:19,016 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:19,016 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 04:27:19,017 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73491850] [2019-12-27 04:27:19,017 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 04:27:19,017 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:19,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 04:27:19,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 04:27:19,018 INFO L87 Difference]: Start difference. First operand 1431 states and 3178 transitions. Second operand 6 states. [2019-12-27 04:27:19,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:19,725 INFO L93 Difference]: Finished difference Result 1817 states and 4039 transitions. [2019-12-27 04:27:19,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:27:19,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-27 04:27:19,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:19,738 INFO L225 Difference]: With dead ends: 1817 [2019-12-27 04:27:19,738 INFO L226 Difference]: Without dead ends: 1817 [2019-12-27 04:27:19,738 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 04:27:19,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1817 states. [2019-12-27 04:27:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1817 to 1538. [2019-12-27 04:27:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1538 states. [2019-12-27 04:27:19,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1538 states to 1538 states and 3423 transitions. [2019-12-27 04:27:19,784 INFO L78 Accepts]: Start accepts. Automaton has 1538 states and 3423 transitions. Word has length 8 [2019-12-27 04:27:19,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:19,785 INFO L462 AbstractCegarLoop]: Abstraction has 1538 states and 3423 transitions. [2019-12-27 04:27:19,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 04:27:19,786 INFO L276 IsEmpty]: Start isEmpty. Operand 1538 states and 3423 transitions. [2019-12-27 04:27:19,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-27 04:27:19,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:19,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:19,789 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 04:27:19,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:19,790 INFO L82 PathProgramCache]: Analyzing trace with hash 534612052, now seen corresponding path program 1 times [2019-12-27 04:27:19,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:19,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42496937] [2019-12-27 04:27:19,790 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:19,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:19,877 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 04:27:19,878 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42496937] [2019-12-27 04:27:19,878 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:19,878 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 04:27:19,879 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750878837] [2019-12-27 04:27:19,879 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 04:27:19,879 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:19,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 04:27:19,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 04:27:19,880 INFO L87 Difference]: Start difference. First operand 1538 states and 3423 transitions. Second operand 3 states. [2019-12-27 04:27:19,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:19,943 INFO L93 Difference]: Finished difference Result 2508 states and 5570 transitions. [2019-12-27 04:27:19,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 04:27:19,944 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2019-12-27 04:27:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:19,957 INFO L225 Difference]: With dead ends: 2508 [2019-12-27 04:27:19,958 INFO L226 Difference]: Without dead ends: 2508 [2019-12-27 04:27:19,958 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 04:27:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2508 states. [2019-12-27 04:27:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2508 to 1595. [2019-12-27 04:27:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-27 04:27:20,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3543 transitions. [2019-12-27 04:27:20,009 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3543 transitions. Word has length 10 [2019-12-27 04:27:20,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:20,010 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3543 transitions. [2019-12-27 04:27:20,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 04:27:20,011 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3543 transitions. [2019-12-27 04:27:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:27:20,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:20,018 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:20,018 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 04:27:20,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:20,020 INFO L82 PathProgramCache]: Analyzing trace with hash 2116295203, now seen corresponding path program 1 times [2019-12-27 04:27:20,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:20,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622813685] [2019-12-27 04:27:20,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:20,162 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 04:27:20,163 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622813685] [2019-12-27 04:27:20,163 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:20,163 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:27:20,164 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654008961] [2019-12-27 04:27:20,164 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:27:20,164 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:27:20,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:27:20,165 INFO L87 Difference]: Start difference. First operand 1595 states and 3543 transitions. Second operand 8 states. [2019-12-27 04:27:21,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:21,270 INFO L93 Difference]: Finished difference Result 1987 states and 4399 transitions. [2019-12-27 04:27:21,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 04:27:21,271 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-27 04:27:21,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:21,283 INFO L225 Difference]: With dead ends: 1987 [2019-12-27 04:27:21,283 INFO L226 Difference]: Without dead ends: 1987 [2019-12-27 04:27:21,284 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=177, Unknown=0, NotChecked=0, Total=272 [2019-12-27 04:27:21,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1987 states. [2019-12-27 04:27:21,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1987 to 1609. [2019-12-27 04:27:21,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1609 states. [2019-12-27 04:27:21,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1609 states to 1609 states and 3575 transitions. [2019-12-27 04:27:21,327 INFO L78 Accepts]: Start accepts. Automaton has 1609 states and 3575 transitions. Word has length 14 [2019-12-27 04:27:21,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:21,328 INFO L462 AbstractCegarLoop]: Abstraction has 1609 states and 3575 transitions. [2019-12-27 04:27:21,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:27:21,328 INFO L276 IsEmpty]: Start isEmpty. Operand 1609 states and 3575 transitions. [2019-12-27 04:27:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:27:21,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:21,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:21,330 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 04:27:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:21,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1320004501, now seen corresponding path program 2 times [2019-12-27 04:27:21,330 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:21,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758265414] [2019-12-27 04:27:21,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:21,477 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 04:27:21,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758265414] [2019-12-27 04:27:21,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:21,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:27:21,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846996984] [2019-12-27 04:27:21,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:27:21,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:21,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:27:21,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:27:21,479 INFO L87 Difference]: Start difference. First operand 1609 states and 3575 transitions. Second operand 11 states. [2019-12-27 04:27:23,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:23,308 INFO L93 Difference]: Finished difference Result 2023 states and 4477 transitions. [2019-12-27 04:27:23,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:27:23,309 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 04:27:23,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:23,321 INFO L225 Difference]: With dead ends: 2023 [2019-12-27 04:27:23,321 INFO L226 Difference]: Without dead ends: 2023 [2019-12-27 04:27:23,322 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=233, Invalid=469, Unknown=0, NotChecked=0, Total=702 [2019-12-27 04:27:23,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2023 states. [2019-12-27 04:27:23,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2023 to 1611. [2019-12-27 04:27:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1611 states. [2019-12-27 04:27:23,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1611 states to 1611 states and 3579 transitions. [2019-12-27 04:27:23,362 INFO L78 Accepts]: Start accepts. Automaton has 1611 states and 3579 transitions. Word has length 14 [2019-12-27 04:27:23,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:23,362 INFO L462 AbstractCegarLoop]: Abstraction has 1611 states and 3579 transitions. [2019-12-27 04:27:23,363 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:27:23,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1611 states and 3579 transitions. [2019-12-27 04:27:23,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:27:23,364 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:23,364 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:23,364 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 04:27:23,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:23,364 INFO L82 PathProgramCache]: Analyzing trace with hash -1957828637, now seen corresponding path program 3 times [2019-12-27 04:27:23,365 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:23,365 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431033098] [2019-12-27 04:27:23,365 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:23,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:23,529 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 04:27:23,529 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431033098] [2019-12-27 04:27:23,529 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:23,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:27:23,531 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464537497] [2019-12-27 04:27:23,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 04:27:23,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:23,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 04:27:23,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:27:23,532 INFO L87 Difference]: Start difference. First operand 1611 states and 3579 transitions. Second operand 11 states. [2019-12-27 04:27:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:25,834 INFO L93 Difference]: Finished difference Result 2052 states and 4538 transitions. [2019-12-27 04:27:25,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:27:25,834 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 14 [2019-12-27 04:27:25,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:25,844 INFO L225 Difference]: With dead ends: 2052 [2019-12-27 04:27:25,845 INFO L226 Difference]: Without dead ends: 2052 [2019-12-27 04:27:25,845 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=280, Invalid=590, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:27:25,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2052 states. [2019-12-27 04:27:25,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2052 to 1604. [2019-12-27 04:27:25,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-27 04:27:25,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3563 transitions. [2019-12-27 04:27:25,881 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3563 transitions. Word has length 14 [2019-12-27 04:27:25,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:25,882 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3563 transitions. [2019-12-27 04:27:25,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 04:27:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3563 transitions. [2019-12-27 04:27:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 04:27:25,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:25,883 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:25,883 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 04:27:25,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:25,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1287222187, now seen corresponding path program 1 times [2019-12-27 04:27:25,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:25,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582953413] [2019-12-27 04:27:25,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:25,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:26,031 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 04:27:26,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582953413] [2019-12-27 04:27:26,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:26,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 04:27:26,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432297595] [2019-12-27 04:27:26,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 04:27:26,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:26,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 04:27:26,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 04:27:26,034 INFO L87 Difference]: Start difference. First operand 1604 states and 3563 transitions. Second operand 8 states. [2019-12-27 04:27:27,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:27,096 INFO L93 Difference]: Finished difference Result 2382 states and 5288 transitions. [2019-12-27 04:27:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 04:27:27,097 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-12-27 04:27:27,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:27,108 INFO L225 Difference]: With dead ends: 2382 [2019-12-27 04:27:27,108 INFO L226 Difference]: Without dead ends: 2345 [2019-12-27 04:27:27,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 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 04:27:27,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2345 states. [2019-12-27 04:27:27,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2345 to 1762. [2019-12-27 04:27:27,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1762 states. [2019-12-27 04:27:27,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1762 states to 1762 states and 3963 transitions. [2019-12-27 04:27:27,153 INFO L78 Accepts]: Start accepts. Automaton has 1762 states and 3963 transitions. Word has length 14 [2019-12-27 04:27:27,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:27,154 INFO L462 AbstractCegarLoop]: Abstraction has 1762 states and 3963 transitions. [2019-12-27 04:27:27,154 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 04:27:27,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1762 states and 3963 transitions. [2019-12-27 04:27:27,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:27,155 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:27,155 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:27,155 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 04:27:27,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:27,156 INFO L82 PathProgramCache]: Analyzing trace with hash 2126637629, now seen corresponding path program 1 times [2019-12-27 04:27:27,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:27,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234800286] [2019-12-27 04:27:27,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:27,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:27,348 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 04:27:27,348 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234800286] [2019-12-27 04:27:27,348 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:27,348 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:27:27,348 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242721765] [2019-12-27 04:27:27,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:27:27,349 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:27,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:27:27,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:27:27,349 INFO L87 Difference]: Start difference. First operand 1762 states and 3963 transitions. Second operand 7 states. [2019-12-27 04:27:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:28,262 INFO L93 Difference]: Finished difference Result 2376 states and 5313 transitions. [2019-12-27 04:27:28,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:27:28,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 04:27:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:28,273 INFO L225 Difference]: With dead ends: 2376 [2019-12-27 04:27:28,273 INFO L226 Difference]: Without dead ends: 2376 [2019-12-27 04:27:28,273 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:27:28,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2376 states. [2019-12-27 04:27:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2376 to 1843. [2019-12-27 04:27:28,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1843 states. [2019-12-27 04:27:28,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1843 states to 1843 states and 4143 transitions. [2019-12-27 04:27:28,313 INFO L78 Accepts]: Start accepts. Automaton has 1843 states and 4143 transitions. Word has length 15 [2019-12-27 04:27:28,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:28,314 INFO L462 AbstractCegarLoop]: Abstraction has 1843 states and 4143 transitions. [2019-12-27 04:27:28,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:27:28,314 INFO L276 IsEmpty]: Start isEmpty. Operand 1843 states and 4143 transitions. [2019-12-27 04:27:28,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:28,315 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:28,315 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:28,316 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 04:27:28,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:28,316 INFO L82 PathProgramCache]: Analyzing trace with hash -287376241, now seen corresponding path program 2 times [2019-12-27 04:27:28,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:28,316 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983049023] [2019-12-27 04:27:28,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:28,822 WARN L192 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 35 [2019-12-27 04:27:28,903 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 04:27:28,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983049023] [2019-12-27 04:27:28,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:28,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:27:28,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316971396] [2019-12-27 04:27:28,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:27:28,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:28,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:27:28,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:27:28,905 INFO L87 Difference]: Start difference. First operand 1843 states and 4143 transitions. Second operand 13 states. [2019-12-27 04:27:31,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:31,893 INFO L93 Difference]: Finished difference Result 2686 states and 5978 transitions. [2019-12-27 04:27:31,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 04:27:31,893 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:27:31,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:31,901 INFO L225 Difference]: With dead ends: 2686 [2019-12-27 04:27:31,902 INFO L226 Difference]: Without dead ends: 2686 [2019-12-27 04:27:31,902 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2019-12-27 04:27:31,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2019-12-27 04:27:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 1867. [2019-12-27 04:27:31,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1867 states. [2019-12-27 04:27:31,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1867 states to 1867 states and 4199 transitions. [2019-12-27 04:27:31,945 INFO L78 Accepts]: Start accepts. Automaton has 1867 states and 4199 transitions. Word has length 15 [2019-12-27 04:27:31,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:31,945 INFO L462 AbstractCegarLoop]: Abstraction has 1867 states and 4199 transitions. [2019-12-27 04:27:31,945 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:27:31,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1867 states and 4199 transitions. [2019-12-27 04:27:31,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:31,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:31,947 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:31,947 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 04:27:31,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:31,947 INFO L82 PathProgramCache]: Analyzing trace with hash 456627383, now seen corresponding path program 1 times [2019-12-27 04:27:31,948 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:31,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790971885] [2019-12-27 04:27:31,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:32,074 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 04:27:32,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790971885] [2019-12-27 04:27:32,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:32,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 04:27:32,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848228815] [2019-12-27 04:27:32,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:27:32,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:32,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:27:32,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:27:32,076 INFO L87 Difference]: Start difference. First operand 1867 states and 4199 transitions. Second operand 10 states. [2019-12-27 04:27:33,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:33,431 INFO L93 Difference]: Finished difference Result 2432 states and 5429 transitions. [2019-12-27 04:27:33,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 04:27:33,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 15 [2019-12-27 04:27:33,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:33,437 INFO L225 Difference]: With dead ends: 2432 [2019-12-27 04:27:33,438 INFO L226 Difference]: Without dead ends: 2432 [2019-12-27 04:27:33,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2019-12-27 04:27:33,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2432 states. [2019-12-27 04:27:33,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2432 to 1929. [2019-12-27 04:27:33,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1929 states. [2019-12-27 04:27:33,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 4344 transitions. [2019-12-27 04:27:33,477 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 4344 transitions. Word has length 15 [2019-12-27 04:27:33,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:33,477 INFO L462 AbstractCegarLoop]: Abstraction has 1929 states and 4344 transitions. [2019-12-27 04:27:33,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:27:33,478 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 4344 transitions. [2019-12-27 04:27:33,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:33,479 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:33,479 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:33,479 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 04:27:33,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:33,480 INFO L82 PathProgramCache]: Analyzing trace with hash -1240586563, now seen corresponding path program 3 times [2019-12-27 04:27:33,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:33,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211731009] [2019-12-27 04:27:33,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:33,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:33,876 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 04:27:33,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211731009] [2019-12-27 04:27:33,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:33,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:27:33,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441836459] [2019-12-27 04:27:33,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:27:33,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:33,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:27:33,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:27:33,878 INFO L87 Difference]: Start difference. First operand 1929 states and 4344 transitions. Second operand 13 states. [2019-12-27 04:27:35,496 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 51 [2019-12-27 04:27:35,752 WARN L192 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 53 [2019-12-27 04:27:36,960 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 56 [2019-12-27 04:27:37,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:37,958 INFO L93 Difference]: Finished difference Result 2888 states and 6449 transitions. [2019-12-27 04:27:37,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 04:27:37,958 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:27:37,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:37,966 INFO L225 Difference]: With dead ends: 2888 [2019-12-27 04:27:37,967 INFO L226 Difference]: Without dead ends: 2888 [2019-12-27 04:27:37,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=376, Invalid=884, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:27:37,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2888 states. [2019-12-27 04:27:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2888 to 1968. [2019-12-27 04:27:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1968 states. [2019-12-27 04:27:38,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1968 states to 1968 states and 4437 transitions. [2019-12-27 04:27:38,010 INFO L78 Accepts]: Start accepts. Automaton has 1968 states and 4437 transitions. Word has length 15 [2019-12-27 04:27:38,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:38,010 INFO L462 AbstractCegarLoop]: Abstraction has 1968 states and 4437 transitions. [2019-12-27 04:27:38,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:27:38,010 INFO L276 IsEmpty]: Start isEmpty. Operand 1968 states and 4437 transitions. [2019-12-27 04:27:38,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:38,012 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:38,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:38,012 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 04:27:38,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:38,013 INFO L82 PathProgramCache]: Analyzing trace with hash 287771511, now seen corresponding path program 2 times [2019-12-27 04:27:38,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:38,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756766833] [2019-12-27 04:27:38,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:38,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:38,228 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 04:27:38,228 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756766833] [2019-12-27 04:27:38,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:38,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:27:38,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515562042] [2019-12-27 04:27:38,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:27:38,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:38,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:27:38,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:27:38,230 INFO L87 Difference]: Start difference. First operand 1968 states and 4437 transitions. Second operand 14 states. [2019-12-27 04:27:42,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:42,277 INFO L93 Difference]: Finished difference Result 3807 states and 8456 transitions. [2019-12-27 04:27:42,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:27:42,278 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 15 [2019-12-27 04:27:42,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:42,289 INFO L225 Difference]: With dead ends: 3807 [2019-12-27 04:27:42,289 INFO L226 Difference]: Without dead ends: 3807 [2019-12-27 04:27:42,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=491, Invalid=1149, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:27:42,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3807 states. [2019-12-27 04:27:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3807 to 1947. [2019-12-27 04:27:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1947 states. [2019-12-27 04:27:42,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 4387 transitions. [2019-12-27 04:27:42,337 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 4387 transitions. Word has length 15 [2019-12-27 04:27:42,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:42,337 INFO L462 AbstractCegarLoop]: Abstraction has 1947 states and 4387 transitions. [2019-12-27 04:27:42,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:27:42,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 4387 transitions. [2019-12-27 04:27:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:42,339 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:42,339 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:42,339 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 04:27:42,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:42,340 INFO L82 PathProgramCache]: Analyzing trace with hash 511503391, now seen corresponding path program 4 times [2019-12-27 04:27:42,340 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:42,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490723660] [2019-12-27 04:27:42,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:42,684 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 04:27:42,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490723660] [2019-12-27 04:27:42,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:42,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:27:42,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953189156] [2019-12-27 04:27:42,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:27:42,685 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:42,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:27:42,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:27:42,686 INFO L87 Difference]: Start difference. First operand 1947 states and 4387 transitions. Second operand 13 states. [2019-12-27 04:27:46,444 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-12-27 04:27:48,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:48,164 INFO L93 Difference]: Finished difference Result 2712 states and 6057 transitions. [2019-12-27 04:27:48,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 04:27:48,164 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:27:48,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:48,170 INFO L225 Difference]: With dead ends: 2712 [2019-12-27 04:27:48,171 INFO L226 Difference]: Without dead ends: 2712 [2019-12-27 04:27:48,171 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=501, Invalid=1221, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:27:48,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2712 states. [2019-12-27 04:27:48,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2712 to 1926. [2019-12-27 04:27:48,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1926 states. [2019-12-27 04:27:48,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 4335 transitions. [2019-12-27 04:27:48,210 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 4335 transitions. Word has length 15 [2019-12-27 04:27:48,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:48,210 INFO L462 AbstractCegarLoop]: Abstraction has 1926 states and 4335 transitions. [2019-12-27 04:27:48,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:27:48,211 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 4335 transitions. [2019-12-27 04:27:48,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:48,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:48,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:48,212 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 04:27:48,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:48,213 INFO L82 PathProgramCache]: Analyzing trace with hash -738259267, now seen corresponding path program 5 times [2019-12-27 04:27:48,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:48,213 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539955073] [2019-12-27 04:27:48,213 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:48,498 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 04:27:48,499 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539955073] [2019-12-27 04:27:48,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:48,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:27:48,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507867962] [2019-12-27 04:27:48,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:27:48,500 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:48,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:27:48,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:27:48,501 INFO L87 Difference]: Start difference. First operand 1926 states and 4335 transitions. Second operand 13 states. [2019-12-27 04:27:51,324 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 52 [2019-12-27 04:27:53,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:53,828 INFO L93 Difference]: Finished difference Result 2468 states and 5513 transitions. [2019-12-27 04:27:53,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:27:53,829 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:27:53,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:53,835 INFO L225 Difference]: With dead ends: 2468 [2019-12-27 04:27:53,835 INFO L226 Difference]: Without dead ends: 2468 [2019-12-27 04:27:53,836 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=431, Invalid=1129, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:27:53,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2468 states. [2019-12-27 04:27:53,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2468 to 1919. [2019-12-27 04:27:53,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1919 states. [2019-12-27 04:27:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1919 states to 1919 states and 4320 transitions. [2019-12-27 04:27:53,875 INFO L78 Accepts]: Start accepts. Automaton has 1919 states and 4320 transitions. Word has length 15 [2019-12-27 04:27:53,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:53,875 INFO L462 AbstractCegarLoop]: Abstraction has 1919 states and 4320 transitions. [2019-12-27 04:27:53,875 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:27:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 1919 states and 4320 transitions. [2019-12-27 04:27:53,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:53,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:53,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:53,884 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 04:27:53,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:53,884 INFO L82 PathProgramCache]: Analyzing trace with hash -1923654897, now seen corresponding path program 6 times [2019-12-27 04:27:53,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:53,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2130042066] [2019-12-27 04:27:53,888 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:53,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:54,210 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 04:27:54,210 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2130042066] [2019-12-27 04:27:54,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:54,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:27:54,210 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388500767] [2019-12-27 04:27:54,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:27:54,211 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:54,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:27:54,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:27:54,211 INFO L87 Difference]: Start difference. First operand 1919 states and 4320 transitions. Second operand 13 states. [2019-12-27 04:27:55,668 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 40 [2019-12-27 04:27:58,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:27:58,675 INFO L93 Difference]: Finished difference Result 2464 states and 5507 transitions. [2019-12-27 04:27:58,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-27 04:27:58,675 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:27:58,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:27:58,681 INFO L225 Difference]: With dead ends: 2464 [2019-12-27 04:27:58,681 INFO L226 Difference]: Without dead ends: 2464 [2019-12-27 04:27:58,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 291 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=457, Invalid=1183, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:27:58,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2019-12-27 04:27:58,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1923. [2019-12-27 04:27:58,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1923 states. [2019-12-27 04:27:58,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1923 states to 1923 states and 4328 transitions. [2019-12-27 04:27:58,716 INFO L78 Accepts]: Start accepts. Automaton has 1923 states and 4328 transitions. Word has length 15 [2019-12-27 04:27:58,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:27:58,716 INFO L462 AbstractCegarLoop]: Abstraction has 1923 states and 4328 transitions. [2019-12-27 04:27:58,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:27:58,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1923 states and 4328 transitions. [2019-12-27 04:27:58,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:27:58,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:27:58,718 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:27:58,718 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 04:27:58,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:27:58,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1843716137, now seen corresponding path program 7 times [2019-12-27 04:27:58,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:27:58,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548302981] [2019-12-27 04:27:58,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:27:58,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:27:58,990 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 04:27:58,990 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548302981] [2019-12-27 04:27:58,990 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:27:58,991 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:27:58,991 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076087626] [2019-12-27 04:27:58,992 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:27:58,993 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:27:58,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:27:58,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:27:58,994 INFO L87 Difference]: Start difference. First operand 1923 states and 4328 transitions. Second operand 13 states. [2019-12-27 04:27:59,938 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 41 [2019-12-27 04:28:04,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:04,382 INFO L93 Difference]: Finished difference Result 2426 states and 5423 transitions. [2019-12-27 04:28:04,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 04:28:04,384 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:28:04,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:04,388 INFO L225 Difference]: With dead ends: 2426 [2019-12-27 04:28:04,388 INFO L226 Difference]: Without dead ends: 2426 [2019-12-27 04:28:04,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=443, Invalid=1197, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:28:04,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2426 states. [2019-12-27 04:28:04,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2426 to 1914. [2019-12-27 04:28:04,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1914 states. [2019-12-27 04:28:04,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 4307 transitions. [2019-12-27 04:28:04,410 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 4307 transitions. Word has length 15 [2019-12-27 04:28:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:04,410 INFO L462 AbstractCegarLoop]: Abstraction has 1914 states and 4307 transitions. [2019-12-27 04:28:04,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:28:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 4307 transitions. [2019-12-27 04:28:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:28:04,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:04,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:28:04,412 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 04:28:04,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:04,412 INFO L82 PathProgramCache]: Analyzing trace with hash 2029270197, now seen corresponding path program 3 times [2019-12-27 04:28:04,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:04,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464126073] [2019-12-27 04:28:04,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:04,679 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 04:28:04,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464126073] [2019-12-27 04:28:04,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:04,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:28:04,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855980945] [2019-12-27 04:28:04,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:28:04,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:04,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:28:04,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:28:04,682 INFO L87 Difference]: Start difference. First operand 1914 states and 4307 transitions. Second operand 13 states. [2019-12-27 04:28:07,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:07,435 INFO L93 Difference]: Finished difference Result 2606 states and 5812 transitions. [2019-12-27 04:28:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 04:28:07,435 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:28:07,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:07,439 INFO L225 Difference]: With dead ends: 2606 [2019-12-27 04:28:07,440 INFO L226 Difference]: Without dead ends: 2606 [2019-12-27 04:28:07,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=234, Invalid=578, Unknown=0, NotChecked=0, Total=812 [2019-12-27 04:28:07,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2606 states. [2019-12-27 04:28:07,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2606 to 1920. [2019-12-27 04:28:07,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1920 states. [2019-12-27 04:28:07,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1920 states to 1920 states and 4319 transitions. [2019-12-27 04:28:07,468 INFO L78 Accepts]: Start accepts. Automaton has 1920 states and 4319 transitions. Word has length 15 [2019-12-27 04:28:07,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:07,468 INFO L462 AbstractCegarLoop]: Abstraction has 1920 states and 4319 transitions. [2019-12-27 04:28:07,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:28:07,468 INFO L276 IsEmpty]: Start isEmpty. Operand 1920 states and 4319 transitions. [2019-12-27 04:28:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:28:07,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:07,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:28:07,470 INFO L410 AbstractCegarLoop]: === Iteration 20 === [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 04:28:07,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash -563408835, now seen corresponding path program 4 times [2019-12-27 04:28:07,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:07,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346243571] [2019-12-27 04:28:07,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:07,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:07,631 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 04:28:07,631 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346243571] [2019-12-27 04:28:07,632 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:07,632 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:28:07,632 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399924752] [2019-12-27 04:28:07,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:28:07,633 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:07,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:28:07,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:28:07,633 INFO L87 Difference]: Start difference. First operand 1920 states and 4319 transitions. Second operand 13 states. [2019-12-27 04:28:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:11,408 INFO L93 Difference]: Finished difference Result 2632 states and 5860 transitions. [2019-12-27 04:28:11,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 04:28:11,408 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:28:11,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:11,412 INFO L225 Difference]: With dead ends: 2632 [2019-12-27 04:28:11,412 INFO L226 Difference]: Without dead ends: 2632 [2019-12-27 04:28:11,413 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=333, Invalid=857, Unknown=0, NotChecked=0, Total=1190 [2019-12-27 04:28:11,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2632 states. [2019-12-27 04:28:11,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2632 to 1902. [2019-12-27 04:28:11,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1902 states. [2019-12-27 04:28:11,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1902 states to 1902 states and 4278 transitions. [2019-12-27 04:28:11,440 INFO L78 Accepts]: Start accepts. Automaton has 1902 states and 4278 transitions. Word has length 15 [2019-12-27 04:28:11,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:11,440 INFO L462 AbstractCegarLoop]: Abstraction has 1902 states and 4278 transitions. [2019-12-27 04:28:11,440 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:28:11,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1902 states and 4278 transitions. [2019-12-27 04:28:11,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:28:11,441 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:11,442 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:28:11,442 INFO L410 AbstractCegarLoop]: === Iteration 21 === [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 04:28:11,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:11,442 INFO L82 PathProgramCache]: Analyzing trace with hash -646786075, now seen corresponding path program 8 times [2019-12-27 04:28:11,442 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:11,443 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992373439] [2019-12-27 04:28:11,443 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:11,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:11,585 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 04:28:11,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992373439] [2019-12-27 04:28:11,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:11,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:28:11,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237365258] [2019-12-27 04:28:11,587 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:28:11,587 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:11,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:28:11,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:28:11,587 INFO L87 Difference]: Start difference. First operand 1902 states and 4278 transitions. Second operand 7 states. [2019-12-27 04:28:12,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:12,491 INFO L93 Difference]: Finished difference Result 2242 states and 4995 transitions. [2019-12-27 04:28:12,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:28:12,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2019-12-27 04:28:12,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:12,495 INFO L225 Difference]: With dead ends: 2242 [2019-12-27 04:28:12,495 INFO L226 Difference]: Without dead ends: 2242 [2019-12-27 04:28:12,495 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:28:12,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states. [2019-12-27 04:28:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 1853. [2019-12-27 04:28:12,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1853 states. [2019-12-27 04:28:12,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 4163 transitions. [2019-12-27 04:28:12,516 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 4163 transitions. Word has length 15 [2019-12-27 04:28:12,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:12,516 INFO L462 AbstractCegarLoop]: Abstraction has 1853 states and 4163 transitions. [2019-12-27 04:28:12,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:28:12,516 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 4163 transitions. [2019-12-27 04:28:12,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:28:12,518 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:12,518 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:28:12,518 INFO L410 AbstractCegarLoop]: === Iteration 22 === [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 04:28:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1234167351, now seen corresponding path program 9 times [2019-12-27 04:28:12,518 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:12,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411380071] [2019-12-27 04:28:12,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:12,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:13,180 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 04:28:13,181 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411380071] [2019-12-27 04:28:13,181 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:13,181 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:28:13,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830351019] [2019-12-27 04:28:13,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:28:13,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:13,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:28:13,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:28:13,182 INFO L87 Difference]: Start difference. First operand 1853 states and 4163 transitions. Second operand 13 states. [2019-12-27 04:28:15,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:15,860 INFO L93 Difference]: Finished difference Result 2487 states and 5531 transitions. [2019-12-27 04:28:15,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 04:28:15,861 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:28:15,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:15,864 INFO L225 Difference]: With dead ends: 2487 [2019-12-27 04:28:15,865 INFO L226 Difference]: Without dead ends: 2487 [2019-12-27 04:28:15,865 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=135, Invalid=327, Unknown=0, NotChecked=0, Total=462 [2019-12-27 04:28:15,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2019-12-27 04:28:15,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 1855. [2019-12-27 04:28:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1855 states. [2019-12-27 04:28:15,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1855 states to 1855 states and 4169 transitions. [2019-12-27 04:28:15,895 INFO L78 Accepts]: Start accepts. Automaton has 1855 states and 4169 transitions. Word has length 15 [2019-12-27 04:28:15,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:15,895 INFO L462 AbstractCegarLoop]: Abstraction has 1855 states and 4169 transitions. [2019-12-27 04:28:15,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:28:15,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1855 states and 4169 transitions. [2019-12-27 04:28:15,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 04:28:15,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:15,897 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 04:28:15,897 INFO L410 AbstractCegarLoop]: === Iteration 23 === [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 04:28:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash -1347024091, now seen corresponding path program 10 times [2019-12-27 04:28:15,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:15,898 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229082495] [2019-12-27 04:28:15,898 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:15,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:16,383 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 04:28:16,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229082495] [2019-12-27 04:28:16,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:16,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:28:16,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057880914] [2019-12-27 04:28:16,385 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 04:28:16,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:16,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 04:28:16,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-27 04:28:16,385 INFO L87 Difference]: Start difference. First operand 1855 states and 4169 transitions. Second operand 13 states. [2019-12-27 04:28:17,918 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 46 [2019-12-27 04:28:18,930 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 49 [2019-12-27 04:28:20,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:20,100 INFO L93 Difference]: Finished difference Result 2551 states and 5673 transitions. [2019-12-27 04:28:20,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 04:28:20,100 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-12-27 04:28:20,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:20,104 INFO L225 Difference]: With dead ends: 2551 [2019-12-27 04:28:20,104 INFO L226 Difference]: Without dead ends: 2551 [2019-12-27 04:28:20,105 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=295, Invalid=697, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:28:20,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2551 states. [2019-12-27 04:28:20,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2551 to 1811. [2019-12-27 04:28:20,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-12-27 04:28:20,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 4059 transitions. [2019-12-27 04:28:20,134 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 4059 transitions. Word has length 15 [2019-12-27 04:28:20,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:20,134 INFO L462 AbstractCegarLoop]: Abstraction has 1811 states and 4059 transitions. [2019-12-27 04:28:20,134 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 04:28:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 4059 transitions. [2019-12-27 04:28:20,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:28:20,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:20,135 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 04:28:20,136 INFO L410 AbstractCegarLoop]: === Iteration 24 === [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 04:28:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:20,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1298791937, now seen corresponding path program 1 times [2019-12-27 04:28:20,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:20,136 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299505220] [2019-12-27 04:28:20,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:20,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:20,607 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 04:28:20,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299505220] [2019-12-27 04:28:20,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:20,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:28:20,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569261696] [2019-12-27 04:28:20,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:28:20,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:20,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:28:20,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:28:20,609 INFO L87 Difference]: Start difference. First operand 1811 states and 4059 transitions. Second operand 16 states. [2019-12-27 04:28:21,214 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 58 [2019-12-27 04:28:21,555 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-27 04:28:21,881 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2019-12-27 04:28:22,331 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-12-27 04:28:22,844 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 66 [2019-12-27 04:28:22,983 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2019-12-27 04:28:23,243 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 63 [2019-12-27 04:28:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:25,233 INFO L93 Difference]: Finished difference Result 3216 states and 7206 transitions. [2019-12-27 04:28:25,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-12-27 04:28:25,234 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-27 04:28:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:25,238 INFO L225 Difference]: With dead ends: 3216 [2019-12-27 04:28:25,239 INFO L226 Difference]: Without dead ends: 3216 [2019-12-27 04:28:25,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=328, Invalid=932, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:28:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2019-12-27 04:28:25,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2008. [2019-12-27 04:28:25,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2008 states. [2019-12-27 04:28:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2008 states to 2008 states and 4550 transitions. [2019-12-27 04:28:25,273 INFO L78 Accepts]: Start accepts. Automaton has 2008 states and 4550 transitions. Word has length 17 [2019-12-27 04:28:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:25,273 INFO L462 AbstractCegarLoop]: Abstraction has 2008 states and 4550 transitions. [2019-12-27 04:28:25,273 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:28:25,273 INFO L276 IsEmpty]: Start isEmpty. Operand 2008 states and 4550 transitions. [2019-12-27 04:28:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:28:25,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:25,275 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 04:28:25,275 INFO L410 AbstractCegarLoop]: === Iteration 25 === [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 04:28:25,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:25,275 INFO L82 PathProgramCache]: Analyzing trace with hash 163929587, now seen corresponding path program 2 times [2019-12-27 04:28:25,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:25,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97903859] [2019-12-27 04:28:25,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:25,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:25,945 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2019-12-27 04:28:26,130 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 04:28:26,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97903859] [2019-12-27 04:28:26,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:26,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:28:26,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862999110] [2019-12-27 04:28:26,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:28:26,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:26,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:28:26,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:28:26,132 INFO L87 Difference]: Start difference. First operand 2008 states and 4550 transitions. Second operand 16 states. [2019-12-27 04:28:26,886 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 53 [2019-12-27 04:28:27,316 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 54 [2019-12-27 04:28:27,449 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-27 04:28:27,750 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 70 [2019-12-27 04:28:29,304 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 46 [2019-12-27 04:28:32,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:32,063 INFO L93 Difference]: Finished difference Result 3858 states and 8749 transitions. [2019-12-27 04:28:32,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:28:32,063 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-27 04:28:32,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:32,069 INFO L225 Difference]: With dead ends: 3858 [2019-12-27 04:28:32,069 INFO L226 Difference]: Without dead ends: 3858 [2019-12-27 04:28:32,069 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=275, Invalid=985, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:28:32,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3858 states. [2019-12-27 04:28:32,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3858 to 2038. [2019-12-27 04:28:32,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2038 states. [2019-12-27 04:28:32,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2038 states to 2038 states and 4628 transitions. [2019-12-27 04:28:32,097 INFO L78 Accepts]: Start accepts. Automaton has 2038 states and 4628 transitions. Word has length 17 [2019-12-27 04:28:32,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:32,098 INFO L462 AbstractCegarLoop]: Abstraction has 2038 states and 4628 transitions. [2019-12-27 04:28:32,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:28:32,098 INFO L276 IsEmpty]: Start isEmpty. Operand 2038 states and 4628 transitions. [2019-12-27 04:28:32,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:28:32,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:32,099 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 04:28:32,099 INFO L410 AbstractCegarLoop]: === Iteration 26 === [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 04:28:32,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash -175437185, now seen corresponding path program 3 times [2019-12-27 04:28:32,099 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:32,099 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375156414] [2019-12-27 04:28:32,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:32,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:32,604 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 04:28:32,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375156414] [2019-12-27 04:28:32,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:32,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:28:32,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656696241] [2019-12-27 04:28:32,605 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:28:32,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:32,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:28:32,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:28:32,606 INFO L87 Difference]: Start difference. First operand 2038 states and 4628 transitions. Second operand 15 states. [2019-12-27 04:28:33,357 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 55 [2019-12-27 04:28:33,832 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 60 [2019-12-27 04:28:33,998 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 56 [2019-12-27 04:28:34,321 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 45 [2019-12-27 04:28:34,551 WARN L192 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 74 [2019-12-27 04:28:35,981 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 48 [2019-12-27 04:28:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:37,717 INFO L93 Difference]: Finished difference Result 3900 states and 8819 transitions. [2019-12-27 04:28:37,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:28:37,717 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:28:37,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:37,723 INFO L225 Difference]: With dead ends: 3900 [2019-12-27 04:28:37,723 INFO L226 Difference]: Without dead ends: 3900 [2019-12-27 04:28:37,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=367, Invalid=1115, Unknown=0, NotChecked=0, Total=1482 [2019-12-27 04:28:37,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3900 states. [2019-12-27 04:28:37,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3900 to 2054. [2019-12-27 04:28:37,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2054 states. [2019-12-27 04:28:37,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2054 states to 2054 states and 4664 transitions. [2019-12-27 04:28:37,759 INFO L78 Accepts]: Start accepts. Automaton has 2054 states and 4664 transitions. Word has length 17 [2019-12-27 04:28:37,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:37,760 INFO L462 AbstractCegarLoop]: Abstraction has 2054 states and 4664 transitions. [2019-12-27 04:28:37,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:28:37,760 INFO L276 IsEmpty]: Start isEmpty. Operand 2054 states and 4664 transitions. [2019-12-27 04:28:37,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:28:37,761 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:37,761 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 04:28:37,762 INFO L410 AbstractCegarLoop]: === Iteration 27 === [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 04:28:37,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:37,762 INFO L82 PathProgramCache]: Analyzing trace with hash -591050465, now seen corresponding path program 4 times [2019-12-27 04:28:37,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:37,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541438277] [2019-12-27 04:28:37,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:37,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:38,175 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 04:28:38,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541438277] [2019-12-27 04:28:38,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:38,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:28:38,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036894464] [2019-12-27 04:28:38,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:28:38,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:38,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:28:38,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:28:38,177 INFO L87 Difference]: Start difference. First operand 2054 states and 4664 transitions. Second operand 16 states. [2019-12-27 04:28:39,517 WARN L192 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 52 [2019-12-27 04:28:39,847 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2019-12-27 04:28:40,208 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 50 [2019-12-27 04:28:40,805 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-12-27 04:28:41,338 WARN L192 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 56 [2019-12-27 04:28:41,743 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 53 [2019-12-27 04:28:43,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:43,829 INFO L93 Difference]: Finished difference Result 3682 states and 8334 transitions. [2019-12-27 04:28:43,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 04:28:43,829 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-27 04:28:43,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:43,835 INFO L225 Difference]: With dead ends: 3682 [2019-12-27 04:28:43,835 INFO L226 Difference]: Without dead ends: 3682 [2019-12-27 04:28:43,835 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=413, Invalid=1147, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:28:43,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3682 states. [2019-12-27 04:28:43,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3682 to 2021. [2019-12-27 04:28:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2021 states. [2019-12-27 04:28:43,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2021 states to 2021 states and 4580 transitions. [2019-12-27 04:28:43,861 INFO L78 Accepts]: Start accepts. Automaton has 2021 states and 4580 transitions. Word has length 17 [2019-12-27 04:28:43,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:43,861 INFO L462 AbstractCegarLoop]: Abstraction has 2021 states and 4580 transitions. [2019-12-27 04:28:43,861 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:28:43,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2021 states and 4580 transitions. [2019-12-27 04:28:43,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:28:43,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:43,862 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 04:28:43,862 INFO L410 AbstractCegarLoop]: === Iteration 28 === [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 04:28:43,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:43,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1789089965, now seen corresponding path program 5 times [2019-12-27 04:28:43,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:43,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021662713] [2019-12-27 04:28:43,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:44,431 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 04:28:44,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021662713] [2019-12-27 04:28:44,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:44,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:28:44,432 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4405818] [2019-12-27 04:28:44,432 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:28:44,432 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:44,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:28:44,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:28:44,433 INFO L87 Difference]: Start difference. First operand 2021 states and 4580 transitions. Second operand 15 states. [2019-12-27 04:28:45,329 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-12-27 04:28:45,862 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 52 [2019-12-27 04:28:46,390 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 53 [2019-12-27 04:28:47,009 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 55 [2019-12-27 04:28:47,429 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 53 [2019-12-27 04:28:47,725 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2019-12-27 04:28:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:49,668 INFO L93 Difference]: Finished difference Result 3660 states and 8249 transitions. [2019-12-27 04:28:49,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:28:49,669 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:28:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:49,673 INFO L225 Difference]: With dead ends: 3660 [2019-12-27 04:28:49,673 INFO L226 Difference]: Without dead ends: 3660 [2019-12-27 04:28:49,674 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=330, Invalid=930, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 04:28:49,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2019-12-27 04:28:49,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 2007. [2019-12-27 04:28:49,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2007 states. [2019-12-27 04:28:49,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2007 states to 2007 states and 4547 transitions. [2019-12-27 04:28:49,709 INFO L78 Accepts]: Start accepts. Automaton has 2007 states and 4547 transitions. Word has length 17 [2019-12-27 04:28:49,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:49,709 INFO L462 AbstractCegarLoop]: Abstraction has 2007 states and 4547 transitions. [2019-12-27 04:28:49,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:28:49,710 INFO L276 IsEmpty]: Start isEmpty. Operand 2007 states and 4547 transitions. [2019-12-27 04:28:49,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:28:49,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:49,713 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 04:28:49,713 INFO L410 AbstractCegarLoop]: === Iteration 29 === [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 04:28:49,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:49,713 INFO L82 PathProgramCache]: Analyzing trace with hash -1670599107, now seen corresponding path program 6 times [2019-12-27 04:28:49,713 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:49,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327800397] [2019-12-27 04:28:49,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:50,277 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 04:28:50,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327800397] [2019-12-27 04:28:50,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:50,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:28:50,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074059203] [2019-12-27 04:28:50,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:28:50,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:50,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:28:50,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:28:50,279 INFO L87 Difference]: Start difference. First operand 2007 states and 4547 transitions. Second operand 16 states. [2019-12-27 04:28:51,225 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 46 [2019-12-27 04:28:51,962 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-12-27 04:28:52,358 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-12-27 04:28:53,041 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 49 [2019-12-27 04:28:53,713 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-12-27 04:28:54,196 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-12-27 04:28:56,182 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 48 [2019-12-27 04:28:56,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:28:56,715 INFO L93 Difference]: Finished difference Result 3215 states and 7259 transitions. [2019-12-27 04:28:56,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:28:56,715 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-27 04:28:56,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:28:56,720 INFO L225 Difference]: With dead ends: 3215 [2019-12-27 04:28:56,720 INFO L226 Difference]: Without dead ends: 3215 [2019-12-27 04:28:56,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=417, Invalid=1223, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 04:28:56,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3215 states. [2019-12-27 04:28:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3215 to 2010. [2019-12-27 04:28:56,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2010 states. [2019-12-27 04:28:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2010 states to 2010 states and 4554 transitions. [2019-12-27 04:28:56,746 INFO L78 Accepts]: Start accepts. Automaton has 2010 states and 4554 transitions. Word has length 17 [2019-12-27 04:28:56,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:28:56,746 INFO L462 AbstractCegarLoop]: Abstraction has 2010 states and 4554 transitions. [2019-12-27 04:28:56,746 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:28:56,746 INFO L276 IsEmpty]: Start isEmpty. Operand 2010 states and 4554 transitions. [2019-12-27 04:28:56,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:28:56,747 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:28:56,747 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 04:28:56,748 INFO L410 AbstractCegarLoop]: === Iteration 30 === [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 04:28:56,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:28:56,748 INFO L82 PathProgramCache]: Analyzing trace with hash -44171423, now seen corresponding path program 7 times [2019-12-27 04:28:56,748 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:28:56,748 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134726558] [2019-12-27 04:28:56,748 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:28:56,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:28:57,322 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 04:28:57,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134726558] [2019-12-27 04:28:57,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:28:57,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:28:57,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429269132] [2019-12-27 04:28:57,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:28:57,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:28:57,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:28:57,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:28:57,324 INFO L87 Difference]: Start difference. First operand 2010 states and 4554 transitions. Second operand 16 states. [2019-12-27 04:28:58,640 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-12-27 04:28:59,018 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-12-27 04:28:59,429 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-12-27 04:28:59,621 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 49 [2019-12-27 04:29:00,299 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 47 [2019-12-27 04:29:01,003 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 54 [2019-12-27 04:29:01,215 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-12-27 04:29:01,646 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 51 [2019-12-27 04:29:01,836 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-12-27 04:29:02,086 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-12-27 04:29:04,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:04,784 INFO L93 Difference]: Finished difference Result 3485 states and 7889 transitions. [2019-12-27 04:29:04,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 04:29:04,785 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 17 [2019-12-27 04:29:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:04,790 INFO L225 Difference]: With dead ends: 3485 [2019-12-27 04:29:04,791 INFO L226 Difference]: Without dead ends: 3485 [2019-12-27 04:29:04,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 263 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=486, Invalid=1406, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 04:29:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3485 states. [2019-12-27 04:29:04,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3485 to 2011. [2019-12-27 04:29:04,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2011 states. [2019-12-27 04:29:04,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2011 states to 2011 states and 4556 transitions. [2019-12-27 04:29:04,827 INFO L78 Accepts]: Start accepts. Automaton has 2011 states and 4556 transitions. Word has length 17 [2019-12-27 04:29:04,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:04,828 INFO L462 AbstractCegarLoop]: Abstraction has 2011 states and 4556 transitions. [2019-12-27 04:29:04,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:29:04,828 INFO L276 IsEmpty]: Start isEmpty. Operand 2011 states and 4556 transitions. [2019-12-27 04:29:04,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:04,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:04,829 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 04:29:04,829 INFO L410 AbstractCegarLoop]: === Iteration 31 === [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 04:29:04,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:04,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1920355727, now seen corresponding path program 8 times [2019-12-27 04:29:04,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:04,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888476120] [2019-12-27 04:29:04,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:04,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:05,265 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 04:29:05,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888476120] [2019-12-27 04:29:05,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:05,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:29:05,266 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9468654] [2019-12-27 04:29:05,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:29:05,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:05,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:29:05,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:29:05,267 INFO L87 Difference]: Start difference. First operand 2011 states and 4556 transitions. Second operand 12 states. [2019-12-27 04:29:05,999 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-27 04:29:06,135 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 51 [2019-12-27 04:29:06,340 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-12-27 04:29:06,518 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 63 [2019-12-27 04:29:07,038 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 60 [2019-12-27 04:29:07,387 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-27 04:29:07,601 WARN L192 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 72 [2019-12-27 04:29:07,738 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 52 [2019-12-27 04:29:07,894 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 61 [2019-12-27 04:29:08,182 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 64 [2019-12-27 04:29:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:10,439 INFO L93 Difference]: Finished difference Result 2709 states and 6075 transitions. [2019-12-27 04:29:10,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:29:10,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-27 04:29:10,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:10,443 INFO L225 Difference]: With dead ends: 2709 [2019-12-27 04:29:10,443 INFO L226 Difference]: Without dead ends: 2709 [2019-12-27 04:29:10,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=296, Invalid=696, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:29:10,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2709 states. [2019-12-27 04:29:10,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2709 to 2094. [2019-12-27 04:29:10,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-27 04:29:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4744 transitions. [2019-12-27 04:29:10,468 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4744 transitions. Word has length 17 [2019-12-27 04:29:10,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:10,468 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4744 transitions. [2019-12-27 04:29:10,468 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:29:10,468 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4744 transitions. [2019-12-27 04:29:10,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:10,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:10,469 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 04:29:10,470 INFO L410 AbstractCegarLoop]: === Iteration 32 === [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 04:29:10,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:10,470 INFO L82 PathProgramCache]: Analyzing trace with hash 1504742447, now seen corresponding path program 9 times [2019-12-27 04:29:10,470 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:10,470 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219584544] [2019-12-27 04:29:10,470 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:10,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:10,885 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 04:29:10,885 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219584544] [2019-12-27 04:29:10,885 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:10,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:29:10,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792148320] [2019-12-27 04:29:10,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:29:10,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:10,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:29:10,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:29:10,887 INFO L87 Difference]: Start difference. First operand 2094 states and 4744 transitions. Second operand 15 states. [2019-12-27 04:29:11,768 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 51 [2019-12-27 04:29:11,942 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-12-27 04:29:12,108 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 54 [2019-12-27 04:29:12,581 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 55 [2019-12-27 04:29:13,065 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 57 [2019-12-27 04:29:13,210 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 52 [2019-12-27 04:29:13,647 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 54 [2019-12-27 04:29:14,181 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-12-27 04:29:14,441 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 57 [2019-12-27 04:29:15,133 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 60 [2019-12-27 04:29:15,347 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2019-12-27 04:29:15,599 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 57 [2019-12-27 04:29:17,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:17,808 INFO L93 Difference]: Finished difference Result 3416 states and 7740 transitions. [2019-12-27 04:29:17,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 04:29:17,809 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:29:17,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:17,815 INFO L225 Difference]: With dead ends: 3416 [2019-12-27 04:29:17,815 INFO L226 Difference]: Without dead ends: 3416 [2019-12-27 04:29:17,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=524, Invalid=1456, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 04:29:17,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2019-12-27 04:29:17,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 2067. [2019-12-27 04:29:17,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2067 states. [2019-12-27 04:29:17,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 4684 transitions. [2019-12-27 04:29:17,852 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 4684 transitions. Word has length 17 [2019-12-27 04:29:17,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:17,852 INFO L462 AbstractCegarLoop]: Abstraction has 2067 states and 4684 transitions. [2019-12-27 04:29:17,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:29:17,853 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 4684 transitions. [2019-12-27 04:29:17,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:17,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:17,854 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 04:29:17,854 INFO L410 AbstractCegarLoop]: === Iteration 33 === [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 04:29:17,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:17,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1524757119, now seen corresponding path program 10 times [2019-12-27 04:29:17,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:17,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651639077] [2019-12-27 04:29:17,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:17,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:18,312 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 61 [2019-12-27 04:29:18,481 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 04:29:18,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651639077] [2019-12-27 04:29:18,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:18,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-27 04:29:18,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067599053] [2019-12-27 04:29:18,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-27 04:29:18,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:18,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-27 04:29:18,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-12-27 04:29:18,482 INFO L87 Difference]: Start difference. First operand 2067 states and 4684 transitions. Second operand 14 states. [2019-12-27 04:29:19,325 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-12-27 04:29:19,829 WARN L192 SmtUtils]: Spent 264.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 72 [2019-12-27 04:29:22,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:22,074 INFO L93 Difference]: Finished difference Result 3243 states and 7364 transitions. [2019-12-27 04:29:22,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:29:22,075 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 17 [2019-12-27 04:29:22,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:22,079 INFO L225 Difference]: With dead ends: 3243 [2019-12-27 04:29:22,079 INFO L226 Difference]: Without dead ends: 3243 [2019-12-27 04:29:22,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=197, Invalid=673, Unknown=0, NotChecked=0, Total=870 [2019-12-27 04:29:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3243 states. [2019-12-27 04:29:22,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3243 to 2070. [2019-12-27 04:29:22,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2070 states. [2019-12-27 04:29:22,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2070 states to 2070 states and 4692 transitions. [2019-12-27 04:29:22,106 INFO L78 Accepts]: Start accepts. Automaton has 2070 states and 4692 transitions. Word has length 17 [2019-12-27 04:29:22,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:22,107 INFO L462 AbstractCegarLoop]: Abstraction has 2070 states and 4692 transitions. [2019-12-27 04:29:22,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-27 04:29:22,107 INFO L276 IsEmpty]: Start isEmpty. Operand 2070 states and 4692 transitions. [2019-12-27 04:29:22,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:22,108 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:22,108 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 04:29:22,108 INFO L410 AbstractCegarLoop]: === Iteration 34 === [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 04:29:22,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:22,109 INFO L82 PathProgramCache]: Analyzing trace with hash 1109143839, now seen corresponding path program 11 times [2019-12-27 04:29:22,109 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:22,109 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101100752] [2019-12-27 04:29:22,109 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:22,847 WARN L192 SmtUtils]: Spent 365.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 70 [2019-12-27 04:29:23,119 WARN L192 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 51 [2019-12-27 04:29:23,341 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 04:29:23,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101100752] [2019-12-27 04:29:23,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:23,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:29:23,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215692134] [2019-12-27 04:29:23,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:29:23,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:23,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:29:23,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:29:23,342 INFO L87 Difference]: Start difference. First operand 2070 states and 4692 transitions. Second operand 15 states. [2019-12-27 04:29:24,268 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-12-27 04:29:24,783 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 56 [2019-12-27 04:29:25,011 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 74 [2019-12-27 04:29:25,219 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 78 [2019-12-27 04:29:25,522 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 136 DAG size of output: 87 [2019-12-27 04:29:25,758 WARN L192 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2019-12-27 04:29:25,996 WARN L192 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 85 [2019-12-27 04:29:26,202 WARN L192 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 81 [2019-12-27 04:29:26,575 WARN L192 SmtUtils]: Spent 195.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 88 [2019-12-27 04:29:27,343 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-12-27 04:29:27,662 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 80 [2019-12-27 04:29:27,914 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 64 [2019-12-27 04:29:28,298 WARN L192 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 83 [2019-12-27 04:29:30,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:30,698 INFO L93 Difference]: Finished difference Result 4190 states and 9518 transitions. [2019-12-27 04:29:30,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 04:29:30,699 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:29:30,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:30,703 INFO L225 Difference]: With dead ends: 4190 [2019-12-27 04:29:30,704 INFO L226 Difference]: Without dead ends: 4190 [2019-12-27 04:29:30,704 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=456, Invalid=1436, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 04:29:30,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-12-27 04:29:30,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2094. [2019-12-27 04:29:30,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-27 04:29:30,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4758 transitions. [2019-12-27 04:29:30,734 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4758 transitions. Word has length 17 [2019-12-27 04:29:30,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:30,734 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4758 transitions. [2019-12-27 04:29:30,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:29:30,734 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4758 transitions. [2019-12-27 04:29:30,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:30,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:30,735 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 04:29:30,735 INFO L410 AbstractCegarLoop]: === Iteration 35 === [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 04:29:30,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:30,736 INFO L82 PathProgramCache]: Analyzing trace with hash -805683027, now seen corresponding path program 12 times [2019-12-27 04:29:30,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:30,736 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840829662] [2019-12-27 04:29:30,736 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:30,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:31,112 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 04:29:31,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840829662] [2019-12-27 04:29:31,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:31,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:29:31,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116385533] [2019-12-27 04:29:31,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:29:31,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:31,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:29:31,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:29:31,113 INFO L87 Difference]: Start difference. First operand 2094 states and 4758 transitions. Second operand 12 states. [2019-12-27 04:29:31,796 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-27 04:29:31,994 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-12-27 04:29:32,471 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-12-27 04:29:32,765 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 66 [2019-12-27 04:29:32,987 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-12-27 04:29:33,147 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-27 04:29:33,378 WARN L192 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 78 [2019-12-27 04:29:33,519 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 56 [2019-12-27 04:29:33,774 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 68 [2019-12-27 04:29:35,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:35,737 INFO L93 Difference]: Finished difference Result 2541 states and 5719 transitions. [2019-12-27 04:29:35,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:29:35,738 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-27 04:29:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:35,741 INFO L225 Difference]: With dead ends: 2541 [2019-12-27 04:29:35,741 INFO L226 Difference]: Without dead ends: 2541 [2019-12-27 04:29:35,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=261, Invalid=669, Unknown=0, NotChecked=0, Total=930 [2019-12-27 04:29:35,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2541 states. [2019-12-27 04:29:35,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2541 to 2135. [2019-12-27 04:29:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-12-27 04:29:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 4849 transitions. [2019-12-27 04:29:35,767 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 4849 transitions. Word has length 17 [2019-12-27 04:29:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:35,767 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 4849 transitions. [2019-12-27 04:29:35,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:29:35,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 4849 transitions. [2019-12-27 04:29:35,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:35,769 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:35,769 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 04:29:35,769 INFO L410 AbstractCegarLoop]: === Iteration 36 === [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 04:29:35,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:35,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1221296307, now seen corresponding path program 13 times [2019-12-27 04:29:35,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:35,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854379137] [2019-12-27 04:29:35,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:35,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:36,100 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 04:29:36,100 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854379137] [2019-12-27 04:29:36,100 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:36,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:29:36,101 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51524628] [2019-12-27 04:29:36,101 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:29:36,101 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:36,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:29:36,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:29:36,101 INFO L87 Difference]: Start difference. First operand 2135 states and 4849 transitions. Second operand 15 states. [2019-12-27 04:29:37,025 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-12-27 04:29:37,710 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-27 04:29:37,886 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-27 04:29:38,187 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 60 [2019-12-27 04:29:38,540 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 53 [2019-12-27 04:29:39,028 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-12-27 04:29:39,560 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-12-27 04:29:39,894 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 63 [2019-12-27 04:29:40,190 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 56 [2019-12-27 04:29:42,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:42,185 INFO L93 Difference]: Finished difference Result 3272 states and 7447 transitions. [2019-12-27 04:29:42,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 04:29:42,186 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:29:42,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:42,190 INFO L225 Difference]: With dead ends: 3272 [2019-12-27 04:29:42,191 INFO L226 Difference]: Without dead ends: 3272 [2019-12-27 04:29:42,191 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=454, Invalid=1352, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 04:29:42,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2019-12-27 04:29:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 2094. [2019-12-27 04:29:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2094 states. [2019-12-27 04:29:42,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2094 states to 2094 states and 4758 transitions. [2019-12-27 04:29:42,215 INFO L78 Accepts]: Start accepts. Automaton has 2094 states and 4758 transitions. Word has length 17 [2019-12-27 04:29:42,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:42,215 INFO L462 AbstractCegarLoop]: Abstraction has 2094 states and 4758 transitions. [2019-12-27 04:29:42,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:29:42,215 INFO L276 IsEmpty]: Start isEmpty. Operand 2094 states and 4758 transitions. [2019-12-27 04:29:42,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:42,216 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:42,216 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 04:29:42,216 INFO L410 AbstractCegarLoop]: === Iteration 37 === [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 04:29:42,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash -1804550017, now seen corresponding path program 14 times [2019-12-27 04:29:42,216 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:42,217 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829248620] [2019-12-27 04:29:42,217 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:42,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:42,609 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 04:29:42,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829248620] [2019-12-27 04:29:42,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:42,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:29:42,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270273540] [2019-12-27 04:29:42,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:29:42,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:42,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:29:42,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:29:42,612 INFO L87 Difference]: Start difference. First operand 2094 states and 4758 transitions. Second operand 12 states. [2019-12-27 04:29:43,358 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-27 04:29:43,554 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-12-27 04:29:43,699 WARN L192 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 53 [2019-12-27 04:29:44,118 WARN L192 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-12-27 04:29:44,468 WARN L192 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-12-27 04:29:44,628 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-27 04:29:44,770 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-27 04:29:44,999 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-12-27 04:29:46,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:46,658 INFO L93 Difference]: Finished difference Result 2484 states and 5596 transitions. [2019-12-27 04:29:46,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 04:29:46,659 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-27 04:29:46,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:46,662 INFO L225 Difference]: With dead ends: 2484 [2019-12-27 04:29:46,662 INFO L226 Difference]: Without dead ends: 2484 [2019-12-27 04:29:46,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 166 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=273, Invalid=657, Unknown=0, NotChecked=0, Total=930 [2019-12-27 04:29:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2019-12-27 04:29:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2108. [2019-12-27 04:29:46,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2108 states. [2019-12-27 04:29:46,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2108 states to 2108 states and 4788 transitions. [2019-12-27 04:29:46,683 INFO L78 Accepts]: Start accepts. Automaton has 2108 states and 4788 transitions. Word has length 17 [2019-12-27 04:29:46,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:46,683 INFO L462 AbstractCegarLoop]: Abstraction has 2108 states and 4788 transitions. [2019-12-27 04:29:46,683 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:29:46,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2108 states and 4788 transitions. [2019-12-27 04:29:46,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:46,684 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:46,684 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 04:29:46,684 INFO L410 AbstractCegarLoop]: === Iteration 38 === [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 04:29:46,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:46,684 INFO L82 PathProgramCache]: Analyzing trace with hash 2074803999, now seen corresponding path program 15 times [2019-12-27 04:29:46,685 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:46,685 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479067003] [2019-12-27 04:29:46,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:46,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:47,018 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 04:29:47,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479067003] [2019-12-27 04:29:47,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:47,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:29:47,019 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399922318] [2019-12-27 04:29:47,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:29:47,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:47,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:29:47,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:29:47,020 INFO L87 Difference]: Start difference. First operand 2108 states and 4788 transitions. Second operand 15 states. [2019-12-27 04:29:47,953 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 53 [2019-12-27 04:29:49,601 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2019-12-27 04:29:50,113 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-12-27 04:29:50,692 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-12-27 04:29:51,126 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-27 04:29:51,456 WARN L192 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-27 04:29:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:53,884 INFO L93 Difference]: Finished difference Result 3346 states and 7590 transitions. [2019-12-27 04:29:53,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 04:29:53,885 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:29:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:53,890 INFO L225 Difference]: With dead ends: 3346 [2019-12-27 04:29:53,890 INFO L226 Difference]: Without dead ends: 3346 [2019-12-27 04:29:53,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=497, Invalid=1665, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 04:29:53,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-12-27 04:29:53,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2104. [2019-12-27 04:29:53,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2104 states. [2019-12-27 04:29:53,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 4780 transitions. [2019-12-27 04:29:53,917 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 4780 transitions. Word has length 17 [2019-12-27 04:29:53,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:53,917 INFO L462 AbstractCegarLoop]: Abstraction has 2104 states and 4780 transitions. [2019-12-27 04:29:53,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:29:53,917 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 4780 transitions. [2019-12-27 04:29:53,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:53,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:53,918 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 04:29:53,918 INFO L410 AbstractCegarLoop]: === Iteration 39 === [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 04:29:53,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:53,918 INFO L82 PathProgramCache]: Analyzing trace with hash -2018416871, now seen corresponding path program 16 times [2019-12-27 04:29:53,918 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:53,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132116987] [2019-12-27 04:29:53,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:53,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:54,336 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 04:29:54,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132116987] [2019-12-27 04:29:54,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:54,337 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 04:29:54,337 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739371483] [2019-12-27 04:29:54,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:29:54,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:54,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:29:54,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:29:54,338 INFO L87 Difference]: Start difference. First operand 2104 states and 4780 transitions. Second operand 12 states. [2019-12-27 04:29:55,056 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 58 [2019-12-27 04:29:55,259 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 70 [2019-12-27 04:29:55,850 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 64 [2019-12-27 04:29:56,215 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 76 [2019-12-27 04:29:56,378 WARN L192 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 65 [2019-12-27 04:29:56,527 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 56 [2019-12-27 04:29:56,691 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 58 [2019-12-27 04:29:56,924 WARN L192 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 68 [2019-12-27 04:29:57,162 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 70 [2019-12-27 04:29:59,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:29:59,306 INFO L93 Difference]: Finished difference Result 2499 states and 5630 transitions. [2019-12-27 04:29:59,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:29:59,307 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2019-12-27 04:29:59,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:29:59,310 INFO L225 Difference]: With dead ends: 2499 [2019-12-27 04:29:59,310 INFO L226 Difference]: Without dead ends: 2499 [2019-12-27 04:29:59,311 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=271, Invalid=721, Unknown=0, NotChecked=0, Total=992 [2019-12-27 04:29:59,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2019-12-27 04:29:59,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2135. [2019-12-27 04:29:59,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2135 states. [2019-12-27 04:29:59,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2135 states to 2135 states and 4848 transitions. [2019-12-27 04:29:59,337 INFO L78 Accepts]: Start accepts. Automaton has 2135 states and 4848 transitions. Word has length 17 [2019-12-27 04:29:59,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:29:59,337 INFO L462 AbstractCegarLoop]: Abstraction has 2135 states and 4848 transitions. [2019-12-27 04:29:59,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:29:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 2135 states and 4848 transitions. [2019-12-27 04:29:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:29:59,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:29:59,338 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 04:29:59,338 INFO L410 AbstractCegarLoop]: === Iteration 40 === [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 04:29:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:29:59,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1860937145, now seen corresponding path program 17 times [2019-12-27 04:29:59,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:29:59,338 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272713110] [2019-12-27 04:29:59,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:29:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:29:59,698 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 04:29:59,698 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272713110] [2019-12-27 04:29:59,698 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:29:59,698 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:29:59,698 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915565021] [2019-12-27 04:29:59,699 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:29:59,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:29:59,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:29:59,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:29:59,699 INFO L87 Difference]: Start difference. First operand 2135 states and 4848 transitions. Second operand 15 states. [2019-12-27 04:30:01,193 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 54 [2019-12-27 04:30:01,896 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 55 [2019-12-27 04:30:02,305 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 57 [2019-12-27 04:30:02,784 WARN L192 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 56 [2019-12-27 04:30:03,341 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 59 [2019-12-27 04:30:04,027 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 60 [2019-12-27 04:30:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:06,126 INFO L93 Difference]: Finished difference Result 3217 states and 7318 transitions. [2019-12-27 04:30:06,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 04:30:06,127 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:30:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:06,131 INFO L225 Difference]: With dead ends: 3217 [2019-12-27 04:30:06,131 INFO L226 Difference]: Without dead ends: 3217 [2019-12-27 04:30:06,132 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=466, Invalid=1426, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 04:30:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2019-12-27 04:30:06,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 2104. [2019-12-27 04:30:06,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2104 states. [2019-12-27 04:30:06,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 4780 transitions. [2019-12-27 04:30:06,163 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 4780 transitions. Word has length 17 [2019-12-27 04:30:06,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:06,163 INFO L462 AbstractCegarLoop]: Abstraction has 2104 states and 4780 transitions. [2019-12-27 04:30:06,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:30:06,163 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 4780 transitions. [2019-12-27 04:30:06,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 04:30:06,164 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:06,164 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 04:30:06,164 INFO L410 AbstractCegarLoop]: === Iteration 41 === [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 04:30:06,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:06,165 INFO L82 PathProgramCache]: Analyzing trace with hash -1713126635, now seen corresponding path program 18 times [2019-12-27 04:30:06,165 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:06,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374019452] [2019-12-27 04:30:06,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:06,680 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 04:30:06,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374019452] [2019-12-27 04:30:06,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:06,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:30:06,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353947307] [2019-12-27 04:30:06,681 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:30:06,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:06,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:30:06,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:30:06,681 INFO L87 Difference]: Start difference. First operand 2104 states and 4780 transitions. Second operand 15 states. [2019-12-27 04:30:07,198 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 51 [2019-12-27 04:30:07,542 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 50 [2019-12-27 04:30:08,193 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 50 [2019-12-27 04:30:08,578 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 54 [2019-12-27 04:30:09,270 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 53 [2019-12-27 04:30:09,731 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 51 [2019-12-27 04:30:10,039 WARN L192 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 53 [2019-12-27 04:30:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:12,219 INFO L93 Difference]: Finished difference Result 3640 states and 8262 transitions. [2019-12-27 04:30:12,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 04:30:12,219 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 17 [2019-12-27 04:30:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:12,224 INFO L225 Difference]: With dead ends: 3640 [2019-12-27 04:30:12,225 INFO L226 Difference]: Without dead ends: 3640 [2019-12-27 04:30:12,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=275, Invalid=781, Unknown=0, NotChecked=0, Total=1056 [2019-12-27 04:30:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3640 states. [2019-12-27 04:30:12,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3640 to 2013. [2019-12-27 04:30:12,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2013 states. [2019-12-27 04:30:12,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2013 states to 2013 states and 4550 transitions. [2019-12-27 04:30:12,250 INFO L78 Accepts]: Start accepts. Automaton has 2013 states and 4550 transitions. Word has length 17 [2019-12-27 04:30:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:12,250 INFO L462 AbstractCegarLoop]: Abstraction has 2013 states and 4550 transitions. [2019-12-27 04:30:12,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:30:12,250 INFO L276 IsEmpty]: Start isEmpty. Operand 2013 states and 4550 transitions. [2019-12-27 04:30:12,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:12,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:12,251 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 04:30:12,251 INFO L410 AbstractCegarLoop]: === Iteration 42 === [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 04:30:12,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:12,251 INFO L82 PathProgramCache]: Analyzing trace with hash 1192920703, now seen corresponding path program 1 times [2019-12-27 04:30:12,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:12,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864126705] [2019-12-27 04:30:12,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:12,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:12,410 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 04:30:12,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864126705] [2019-12-27 04:30:12,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:12,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 04:30:12,411 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970029045] [2019-12-27 04:30:12,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 04:30:12,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:12,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 04:30:12,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 04:30:12,411 INFO L87 Difference]: Start difference. First operand 2013 states and 4550 transitions. Second operand 7 states. [2019-12-27 04:30:13,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:13,484 INFO L93 Difference]: Finished difference Result 2323 states and 5216 transitions. [2019-12-27 04:30:13,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 04:30:13,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2019-12-27 04:30:13,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:13,487 INFO L225 Difference]: With dead ends: 2323 [2019-12-27 04:30:13,487 INFO L226 Difference]: Without dead ends: 2323 [2019-12-27 04:30:13,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2019-12-27 04:30:13,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2323 states. [2019-12-27 04:30:13,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2323 to 2022. [2019-12-27 04:30:13,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2022 states. [2019-12-27 04:30:13,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2022 states to 2022 states and 4568 transitions. [2019-12-27 04:30:13,508 INFO L78 Accepts]: Start accepts. Automaton has 2022 states and 4568 transitions. Word has length 18 [2019-12-27 04:30:13,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:13,508 INFO L462 AbstractCegarLoop]: Abstraction has 2022 states and 4568 transitions. [2019-12-27 04:30:13,508 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 04:30:13,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2022 states and 4568 transitions. [2019-12-27 04:30:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:13,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:13,509 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 04:30:13,509 INFO L410 AbstractCegarLoop]: === Iteration 43 === [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 04:30:13,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -745285229, now seen corresponding path program 2 times [2019-12-27 04:30:13,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:13,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345808188] [2019-12-27 04:30:13,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:13,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:13,722 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 04:30:13,722 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345808188] [2019-12-27 04:30:13,722 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:13,722 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 04:30:13,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784659769] [2019-12-27 04:30:13,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 04:30:13,723 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:13,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 04:30:13,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 04:30:13,723 INFO L87 Difference]: Start difference. First operand 2022 states and 4568 transitions. Second operand 12 states. [2019-12-27 04:30:15,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:15,885 INFO L93 Difference]: Finished difference Result 2615 states and 5850 transitions. [2019-12-27 04:30:15,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 04:30:15,888 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 18 [2019-12-27 04:30:15,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:15,890 INFO L225 Difference]: With dead ends: 2615 [2019-12-27 04:30:15,890 INFO L226 Difference]: Without dead ends: 2615 [2019-12-27 04:30:15,891 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2019-12-27 04:30:15,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2615 states. [2019-12-27 04:30:15,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2615 to 2102. [2019-12-27 04:30:15,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2102 states. [2019-12-27 04:30:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2102 states to 2102 states and 4756 transitions. [2019-12-27 04:30:15,912 INFO L78 Accepts]: Start accepts. Automaton has 2102 states and 4756 transitions. Word has length 18 [2019-12-27 04:30:15,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:15,912 INFO L462 AbstractCegarLoop]: Abstraction has 2102 states and 4756 transitions. [2019-12-27 04:30:15,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 04:30:15,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2102 states and 4756 transitions. [2019-12-27 04:30:15,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:15,914 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:15,914 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 04:30:15,914 INFO L410 AbstractCegarLoop]: === Iteration 44 === [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 04:30:15,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:15,914 INFO L82 PathProgramCache]: Analyzing trace with hash 214341567, now seen corresponding path program 3 times [2019-12-27 04:30:15,914 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:15,915 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993410130] [2019-12-27 04:30:15,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:16,224 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 04:30:16,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993410130] [2019-12-27 04:30:16,225 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:16,225 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-27 04:30:16,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619839401] [2019-12-27 04:30:16,225 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 04:30:16,225 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:16,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 04:30:16,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:30:16,226 INFO L87 Difference]: Start difference. First operand 2102 states and 4756 transitions. Second operand 16 states. [2019-12-27 04:30:23,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:23,480 INFO L93 Difference]: Finished difference Result 4285 states and 9524 transitions. [2019-12-27 04:30:23,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2019-12-27 04:30:23,481 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 18 [2019-12-27 04:30:23,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:23,486 INFO L225 Difference]: With dead ends: 4285 [2019-12-27 04:30:23,486 INFO L226 Difference]: Without dead ends: 4285 [2019-12-27 04:30:23,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1243 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1213, Invalid=3479, Unknown=0, NotChecked=0, Total=4692 [2019-12-27 04:30:23,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4285 states. [2019-12-27 04:30:23,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4285 to 2095. [2019-12-27 04:30:23,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2095 states. [2019-12-27 04:30:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2095 states to 2095 states and 4739 transitions. [2019-12-27 04:30:23,513 INFO L78 Accepts]: Start accepts. Automaton has 2095 states and 4739 transitions. Word has length 18 [2019-12-27 04:30:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:23,514 INFO L462 AbstractCegarLoop]: Abstraction has 2095 states and 4739 transitions. [2019-12-27 04:30:23,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 04:30:23,514 INFO L276 IsEmpty]: Start isEmpty. Operand 2095 states and 4739 transitions. [2019-12-27 04:30:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:23,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:23,515 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 04:30:23,515 INFO L410 AbstractCegarLoop]: === Iteration 45 === [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 04:30:23,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash -2003239487, now seen corresponding path program 4 times [2019-12-27 04:30:23,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:23,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016437882] [2019-12-27 04:30:23,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:23,690 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 04:30:23,690 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016437882] [2019-12-27 04:30:23,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:23,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:30:23,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533032966] [2019-12-27 04:30:23,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:30:23,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:23,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:30:23,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:30:23,692 INFO L87 Difference]: Start difference. First operand 2095 states and 4739 transitions. Second operand 10 states. [2019-12-27 04:30:25,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:25,725 INFO L93 Difference]: Finished difference Result 2421 states and 5443 transitions. [2019-12-27 04:30:25,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:30:25,726 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-27 04:30:25,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:25,729 INFO L225 Difference]: With dead ends: 2421 [2019-12-27 04:30:25,729 INFO L226 Difference]: Without dead ends: 2421 [2019-12-27 04:30:25,729 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2019-12-27 04:30:25,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2421 states. [2019-12-27 04:30:25,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2421 to 2104. [2019-12-27 04:30:25,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2104 states. [2019-12-27 04:30:25,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2104 states to 2104 states and 4758 transitions. [2019-12-27 04:30:25,750 INFO L78 Accepts]: Start accepts. Automaton has 2104 states and 4758 transitions. Word has length 18 [2019-12-27 04:30:25,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:25,750 INFO L462 AbstractCegarLoop]: Abstraction has 2104 states and 4758 transitions. [2019-12-27 04:30:25,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:30:25,750 INFO L276 IsEmpty]: Start isEmpty. Operand 2104 states and 4758 transitions. [2019-12-27 04:30:25,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:25,751 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:25,751 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 04:30:25,751 INFO L410 AbstractCegarLoop]: === Iteration 46 === [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 04:30:25,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1948532055, now seen corresponding path program 5 times [2019-12-27 04:30:25,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:25,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722301362] [2019-12-27 04:30:25,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:25,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:25,958 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 04:30:25,958 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722301362] [2019-12-27 04:30:25,958 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:25,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 04:30:25,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092054961] [2019-12-27 04:30:25,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 04:30:25,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:25,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 04:30:25,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 04:30:25,959 INFO L87 Difference]: Start difference. First operand 2104 states and 4758 transitions. Second operand 10 states. [2019-12-27 04:30:27,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:27,950 INFO L93 Difference]: Finished difference Result 2631 states and 5885 transitions. [2019-12-27 04:30:27,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 04:30:27,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2019-12-27 04:30:27,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:27,954 INFO L225 Difference]: With dead ends: 2631 [2019-12-27 04:30:27,954 INFO L226 Difference]: Without dead ends: 2631 [2019-12-27 04:30:27,954 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2019-12-27 04:30:27,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2631 states. [2019-12-27 04:30:27,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2631 to 2126. [2019-12-27 04:30:27,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2126 states. [2019-12-27 04:30:27,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2126 states to 2126 states and 4805 transitions. [2019-12-27 04:30:27,975 INFO L78 Accepts]: Start accepts. Automaton has 2126 states and 4805 transitions. Word has length 18 [2019-12-27 04:30:27,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:27,975 INFO L462 AbstractCegarLoop]: Abstraction has 2126 states and 4805 transitions. [2019-12-27 04:30:27,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 04:30:27,975 INFO L276 IsEmpty]: Start isEmpty. Operand 2126 states and 4805 transitions. [2019-12-27 04:30:27,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:27,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:27,976 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 04:30:27,976 INFO L410 AbstractCegarLoop]: === Iteration 47 === [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 04:30:27,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:27,977 INFO L82 PathProgramCache]: Analyzing trace with hash 353521877, now seen corresponding path program 6 times [2019-12-27 04:30:27,977 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:27,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522289316] [2019-12-27 04:30:27,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:27,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:28,243 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 04:30:28,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522289316] [2019-12-27 04:30:28,243 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:28,244 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:30:28,244 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916015560] [2019-12-27 04:30:28,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:30:28,244 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:28,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:30:28,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:30:28,245 INFO L87 Difference]: Start difference. First operand 2126 states and 4805 transitions. Second operand 15 states. [2019-12-27 04:30:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:32,482 INFO L93 Difference]: Finished difference Result 2826 states and 6299 transitions. [2019-12-27 04:30:32,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 04:30:32,483 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:30:32,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:32,487 INFO L225 Difference]: With dead ends: 2826 [2019-12-27 04:30:32,487 INFO L226 Difference]: Without dead ends: 2826 [2019-12-27 04:30:32,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=451, Invalid=1109, Unknown=0, NotChecked=0, Total=1560 [2019-12-27 04:30:32,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2826 states. [2019-12-27 04:30:32,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2826 to 2142. [2019-12-27 04:30:32,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2142 states. [2019-12-27 04:30:32,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2142 states to 2142 states and 4839 transitions. [2019-12-27 04:30:32,511 INFO L78 Accepts]: Start accepts. Automaton has 2142 states and 4839 transitions. Word has length 18 [2019-12-27 04:30:32,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:32,511 INFO L462 AbstractCegarLoop]: Abstraction has 2142 states and 4839 transitions. [2019-12-27 04:30:32,511 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:30:32,511 INFO L276 IsEmpty]: Start isEmpty. Operand 2142 states and 4839 transitions. [2019-12-27 04:30:32,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:32,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:32,512 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 04:30:32,512 INFO L410 AbstractCegarLoop]: === Iteration 48 === [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 04:30:32,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:32,512 INFO L82 PathProgramCache]: Analyzing trace with hash 900985137, now seen corresponding path program 7 times [2019-12-27 04:30:32,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:32,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344248856] [2019-12-27 04:30:32,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:32,812 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 04:30:32,812 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344248856] [2019-12-27 04:30:32,813 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:32,813 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:30:32,813 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254916802] [2019-12-27 04:30:32,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:30:32,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:32,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:30:32,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:30:32,814 INFO L87 Difference]: Start difference. First operand 2142 states and 4839 transitions. Second operand 15 states. [2019-12-27 04:30:35,686 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 60 [2019-12-27 04:30:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:37,858 INFO L93 Difference]: Finished difference Result 2889 states and 6437 transitions. [2019-12-27 04:30:37,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 04:30:37,859 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:30:37,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:37,862 INFO L225 Difference]: With dead ends: 2889 [2019-12-27 04:30:37,863 INFO L226 Difference]: Without dead ends: 2889 [2019-12-27 04:30:37,863 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=384, Invalid=948, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 04:30:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2889 states. [2019-12-27 04:30:37,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2889 to 2143. [2019-12-27 04:30:37,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2143 states. [2019-12-27 04:30:37,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 4841 transitions. [2019-12-27 04:30:37,885 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 4841 transitions. Word has length 18 [2019-12-27 04:30:37,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:37,885 INFO L462 AbstractCegarLoop]: Abstraction has 2143 states and 4841 transitions. [2019-12-27 04:30:37,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:30:37,885 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 4841 transitions. [2019-12-27 04:30:37,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:37,886 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:37,886 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 04:30:37,886 INFO L410 AbstractCegarLoop]: === Iteration 49 === [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 04:30:37,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:37,887 INFO L82 PathProgramCache]: Analyzing trace with hash -979422783, now seen corresponding path program 8 times [2019-12-27 04:30:37,887 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:37,887 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259240320] [2019-12-27 04:30:37,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:37,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:38,149 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 04:30:38,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259240320] [2019-12-27 04:30:38,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:38,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:30:38,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901390510] [2019-12-27 04:30:38,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:30:38,151 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:38,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:30:38,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:30:38,151 INFO L87 Difference]: Start difference. First operand 2143 states and 4841 transitions. Second operand 15 states. [2019-12-27 04:30:40,047 WARN L192 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2019-12-27 04:30:40,197 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 49 [2019-12-27 04:30:40,500 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 51 [2019-12-27 04:30:43,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:43,550 INFO L93 Difference]: Finished difference Result 2881 states and 6420 transitions. [2019-12-27 04:30:43,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-12-27 04:30:43,551 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:30:43,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:43,555 INFO L225 Difference]: With dead ends: 2881 [2019-12-27 04:30:43,555 INFO L226 Difference]: Without dead ends: 2881 [2019-12-27 04:30:43,556 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 189 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=495, Invalid=1227, Unknown=0, NotChecked=0, Total=1722 [2019-12-27 04:30:43,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2019-12-27 04:30:43,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2140. [2019-12-27 04:30:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2140 states. [2019-12-27 04:30:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2140 states to 2140 states and 4835 transitions. [2019-12-27 04:30:43,577 INFO L78 Accepts]: Start accepts. Automaton has 2140 states and 4835 transitions. Word has length 18 [2019-12-27 04:30:43,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:43,577 INFO L462 AbstractCegarLoop]: Abstraction has 2140 states and 4835 transitions. [2019-12-27 04:30:43,577 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:30:43,577 INFO L276 IsEmpty]: Start isEmpty. Operand 2140 states and 4835 transitions. [2019-12-27 04:30:43,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:43,578 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:43,578 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 04:30:43,579 INFO L410 AbstractCegarLoop]: === Iteration 50 === [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 04:30:43,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:43,579 INFO L82 PathProgramCache]: Analyzing trace with hash -1077189483, now seen corresponding path program 9 times [2019-12-27 04:30:43,579 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:43,579 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458585233] [2019-12-27 04:30:43,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:43,821 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 04:30:43,822 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458585233] [2019-12-27 04:30:43,822 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:43,822 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:30:43,822 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779601690] [2019-12-27 04:30:43,823 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:30:43,823 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:43,823 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:30:43,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:30:43,824 INFO L87 Difference]: Start difference. First operand 2140 states and 4835 transitions. Second operand 15 states. [2019-12-27 04:30:48,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:48,898 INFO L93 Difference]: Finished difference Result 2809 states and 6264 transitions. [2019-12-27 04:30:48,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-27 04:30:48,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:30:48,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:48,902 INFO L225 Difference]: With dead ends: 2809 [2019-12-27 04:30:48,902 INFO L226 Difference]: Without dead ends: 2809 [2019-12-27 04:30:48,903 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=384, Invalid=1022, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 04:30:48,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2809 states. [2019-12-27 04:30:48,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2809 to 2134. [2019-12-27 04:30:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2134 states. [2019-12-27 04:30:48,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2134 states to 2134 states and 4822 transitions. [2019-12-27 04:30:48,928 INFO L78 Accepts]: Start accepts. Automaton has 2134 states and 4822 transitions. Word has length 18 [2019-12-27 04:30:48,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:48,929 INFO L462 AbstractCegarLoop]: Abstraction has 2134 states and 4822 transitions. [2019-12-27 04:30:48,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:30:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 2134 states and 4822 transitions. [2019-12-27 04:30:48,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:48,930 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:48,930 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 04:30:48,930 INFO L410 AbstractCegarLoop]: === Iteration 51 === [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 04:30:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1337369893, now seen corresponding path program 10 times [2019-12-27 04:30:48,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:48,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904336336] [2019-12-27 04:30:48,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:49,160 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 04:30:49,160 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904336336] [2019-12-27 04:30:49,160 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:49,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:30:49,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081810584] [2019-12-27 04:30:49,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:30:49,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:30:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:30:49,161 INFO L87 Difference]: Start difference. First operand 2134 states and 4822 transitions. Second operand 15 states. [2019-12-27 04:30:54,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 04:30:54,929 INFO L93 Difference]: Finished difference Result 2872 states and 6402 transitions. [2019-12-27 04:30:54,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-12-27 04:30:54,929 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 18 [2019-12-27 04:30:54,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 04:30:54,933 INFO L225 Difference]: With dead ends: 2872 [2019-12-27 04:30:54,934 INFO L226 Difference]: Without dead ends: 2872 [2019-12-27 04:30:54,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=524, Invalid=1368, Unknown=0, NotChecked=0, Total=1892 [2019-12-27 04:30:54,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2019-12-27 04:30:54,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2133. [2019-12-27 04:30:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2133 states. [2019-12-27 04:30:54,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 4820 transitions. [2019-12-27 04:30:54,956 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 4820 transitions. Word has length 18 [2019-12-27 04:30:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 04:30:54,957 INFO L462 AbstractCegarLoop]: Abstraction has 2133 states and 4820 transitions. [2019-12-27 04:30:54,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 04:30:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 4820 transitions. [2019-12-27 04:30:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 04:30:54,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 04:30:54,958 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 04:30:54,958 INFO L410 AbstractCegarLoop]: === Iteration 52 === [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 04:30:54,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 04:30:54,959 INFO L82 PathProgramCache]: Analyzing trace with hash -706900267, now seen corresponding path program 11 times [2019-12-27 04:30:54,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 04:30:54,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965014495] [2019-12-27 04:30:54,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 04:30:54,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 04:30:55,228 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 04:30:55,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965014495] [2019-12-27 04:30:55,229 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 04:30:55,229 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-27 04:30:55,229 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756821330] [2019-12-27 04:30:55,229 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 04:30:55,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 04:30:55,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 04:30:55,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2019-12-27 04:30:55,230 INFO L87 Difference]: Start difference. First operand 2133 states and 4820 transitions. Second operand 15 states. Received shutdown request... [2019-12-27 04:30:56,129 WARN L209 SmtUtils]: Removed 3 from assertion stack [2019-12-27 04:30:56,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 04:30:56,129 WARN L527 AbstractCegarLoop]: Verification canceled [2019-12-27 04:30:56,132 WARN L227 ceAbstractionStarter]: Timeout [2019-12-27 04:30:56,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:30:56 BasicIcfg [2019-12-27 04:30:56,133 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 04:30:56,134 INFO L168 Benchmark]: Toolchain (without parser) took 245822.89 ms. Allocated memory was 145.2 MB in the beginning and 335.5 MB in the end (delta: 190.3 MB). Free memory was 99.3 MB in the beginning and 157.0 MB in the end (delta: -57.7 MB). Peak memory consumption was 132.6 MB. Max. memory is 7.1 GB. [2019-12-27 04:30:56,134 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 04:30:56,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1013.83 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 130.2 MB in the end (delta: -31.3 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:30:56,135 INFO L168 Benchmark]: Boogie Procedure Inliner took 139.26 ms. Allocated memory is still 202.9 MB. Free memory was 130.2 MB in the beginning and 126.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:30:56,135 INFO L168 Benchmark]: Boogie Preprocessor took 62.50 ms. Allocated memory is still 202.9 MB. Free memory was 126.1 MB in the beginning and 122.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-27 04:30:56,136 INFO L168 Benchmark]: RCFGBuilder took 1108.12 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 122.1 MB in the beginning and 153.9 MB in the end (delta: -31.8 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-12-27 04:30:56,136 INFO L168 Benchmark]: TraceAbstraction took 243493.32 ms. Allocated memory was 235.4 MB in the beginning and 335.5 MB in the end (delta: 100.1 MB). Free memory was 153.9 MB in the beginning and 157.0 MB in the end (delta: -3.1 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. [2019-12-27 04:30:56,138 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.78 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1013.83 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 98.9 MB in the beginning and 130.2 MB in the end (delta: -31.3 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 139.26 ms. Allocated memory is still 202.9 MB. Free memory was 130.2 MB in the beginning and 126.1 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.50 ms. Allocated memory is still 202.9 MB. Free memory was 126.1 MB in the beginning and 122.8 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1108.12 ms. Allocated memory was 202.9 MB in the beginning and 235.4 MB in the end (delta: 32.5 MB). Free memory was 122.1 MB in the beginning and 153.9 MB in the end (delta: -31.8 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243493.32 ms. Allocated memory was 235.4 MB in the beginning and 335.5 MB in the end (delta: 100.1 MB). Free memory was 153.9 MB in the beginning and 157.0 MB in the end (delta: -3.1 MB). Peak memory consumption was 97.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 25.0s, 415 ProgramPointsBefore, 103 ProgramPointsAfterwards, 443 TransitionsBefore, 121 TransitionsAfterwards, 30326 CoEnabledTransitionPairs, 14 FixpointIterations, 121 TrivialSequentialCompositions, 233 ConcurrentSequentialCompositions, 28 TrivialYvCompositions, 76 ConcurrentYvCompositions, 11 ChoiceCompositions, 15998 VarBasedMoverChecksPositive, 666 VarBasedMoverChecksNegative, 507 SemBasedMoverChecksPositive, 333 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 3.5s, 0 MoverChecksTotal, 106197 CheckedPairsTotal, 458 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 (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1087]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1087). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1048]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1048). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1085]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1085). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1011]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1011). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1043]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1043). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1005]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1005). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1065]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1065). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - TimeoutResultAtElement [Line: 1089]: Timeout (TraceAbstraction) Unable to prove that call of __VERIFIER_error() unreachable (line 1089). Cancelled while BasicCegarLoop was constructing difference of abstraction (2133states) and FLOYD_HOARE automaton (currently 15 states, 15 states before enhancement),while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 44 for 23ms.. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 412 locations, 11 error locations. Result: TIMEOUT, OverallTime: 243.3s, OverallIterations: 52, TraceHistogramMax: 1, AutomataDifference: 198.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5469 SDtfs, 25246 SDslu, 14365 SDs, 0 SdLazy, 99679 SolverSat, 2092 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 104.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1540 GetRequests, 46 SyntacticMatches, 13 SemanticMatches, 1480 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8378 ImplicationChecksByTransitivity, 90.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2143occurred in iteration=48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 51 MinimizatonAttempts, 44246 StatesRemovedByMinimization, 49 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 16.2s InterpolantComputationTime, 802 NumberOfCodeBlocks, 802 NumberOfCodeBlocksAsserted, 52 NumberOfCheckSat, 750 ConstructedInterpolants, 0 QuantifiedInterpolants, 292212 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 52 InterpolantComputations, 52 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