/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-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 05:19:46,128 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 05:19:46,131 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 05:19:46,143 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 05:19:46,143 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 05:19:46,145 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 05:19:46,146 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 05:19:46,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 05:19:46,150 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 05:19:46,151 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 05:19:46,152 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 05:19:46,153 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 05:19:46,153 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 05:19:46,154 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 05:19:46,155 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 05:19:46,156 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 05:19:46,157 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 05:19:46,158 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 05:19:46,159 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 05:19:46,162 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 05:19:46,163 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 05:19:46,164 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 05:19:46,165 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 05:19:46,166 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 05:19:46,168 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 05:19:46,169 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 05:19:46,169 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 05:19:46,170 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 05:19:46,171 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 05:19:46,171 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 05:19:46,172 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 05:19:46,172 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 05:19:46,173 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 05:19:46,174 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 05:19:46,175 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 05:19:46,175 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 05:19:46,176 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 05:19:46,176 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 05:19:46,176 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 05:19:46,177 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 05:19:46,178 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 05:19:46,181 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-NoLbe.epf [2019-12-19 05:19:46,201 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 05:19:46,201 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 05:19:46,203 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 05:19:46,203 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 05:19:46,204 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 05:19:46,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 05:19:46,204 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 05:19:46,204 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 05:19:46,204 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 05:19:46,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 05:19:46,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 05:19:46,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 05:19:46,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 05:19:46,207 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 05:19:46,207 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 05:19:46,207 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 05:19:46,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 05:19:46,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 05:19:46,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 05:19:46,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 05:19:46,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 05:19:46,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 05:19:46,209 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 05:19:46,209 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 05:19:46,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 05:19:46,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 05:19:46,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 05:19:46,210 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 05:19:46,210 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 05:19:46,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 05:19:46,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 05:19:46,530 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 05:19:46,533 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 05:19:46,537 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 05:19:46,537 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 05:19:46,538 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-19 05:19:46,614 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7eff57d/04cabbdf4f55433daad866ad50ec10f9/FLAG400bc83f8 [2019-12-19 05:19:47,226 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 05:19:47,227 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe029_pso.oepc.i [2019-12-19 05:19:47,245 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7eff57d/04cabbdf4f55433daad866ad50ec10f9/FLAG400bc83f8 [2019-12-19 05:19:47,496 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ad7eff57d/04cabbdf4f55433daad866ad50ec10f9 [2019-12-19 05:19:47,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 05:19:47,512 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 05:19:47,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 05:19:47,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 05:19:47,519 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 05:19:47,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:19:47" (1/1) ... [2019-12-19 05:19:47,524 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@160dde8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:47, skipping insertion in model container [2019-12-19 05:19:47,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 05:19:47" (1/1) ... [2019-12-19 05:19:47,533 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 05:19:47,601 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 05:19:48,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:19:48,187 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 05:19:48,251 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 05:19:48,323 INFO L208 MainTranslator]: Completed translation [2019-12-19 05:19:48,324 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48 WrapperNode [2019-12-19 05:19:48,324 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 05:19:48,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 05:19:48,325 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 05:19:48,325 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 05:19:48,335 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,355 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,396 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 05:19:48,397 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 05:19:48,397 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 05:19:48,397 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 05:19:48,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,412 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,413 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,426 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,430 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (1/1) ... [2019-12-19 05:19:48,435 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 05:19:48,436 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 05:19:48,436 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 05:19:48,436 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 05:19:48,437 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (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-19 05:19:48,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 05:19:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 05:19:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 05:19:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 05:19:48,520 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 05:19:48,520 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 05:19:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 05:19:48,521 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 05:19:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 05:19:48,521 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 05:19:48,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 05:19:48,523 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 05:19:49,280 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 05:19:49,280 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 05:19:49,281 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:19:49 BoogieIcfgContainer [2019-12-19 05:19:49,282 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 05:19:49,283 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 05:19:49,283 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 05:19:49,286 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 05:19:49,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 05:19:47" (1/3) ... [2019-12-19 05:19:49,288 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71dd9700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:19:49, skipping insertion in model container [2019-12-19 05:19:49,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 05:19:48" (2/3) ... [2019-12-19 05:19:49,289 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71dd9700 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 05:19:49, skipping insertion in model container [2019-12-19 05:19:49,289 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 05:19:49" (3/3) ... [2019-12-19 05:19:49,291 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2019-12-19 05:19:49,302 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 05:19:49,302 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 05:19:49,310 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 05:19:49,311 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 05:19:49,346 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,347 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,347 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,348 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,348 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,349 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,349 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,350 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,351 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,360 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,360 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,361 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,362 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,363 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,367 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,368 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,369 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,370 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,371 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,372 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,373 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,377 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,378 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,379 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,379 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,380 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,380 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,384 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,385 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,386 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 05:19:49,399 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 05:19:49,416 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 05:19:49,416 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 05:19:49,416 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 05:19:49,416 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 05:19:49,416 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 05:19:49,416 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 05:19:49,416 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 05:19:49,417 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 05:19:49,431 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 145 places, 179 transitions [2019-12-19 05:19:50,807 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22509 states. [2019-12-19 05:19:50,809 INFO L276 IsEmpty]: Start isEmpty. Operand 22509 states. [2019-12-19 05:19:50,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-19 05:19:50,816 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:50,817 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:50,818 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:50,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:50,823 INFO L82 PathProgramCache]: Analyzing trace with hash -641553760, now seen corresponding path program 1 times [2019-12-19 05:19:50,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:50,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448436862] [2019-12-19 05:19:50,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:50,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:51,096 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-19 05:19:51,097 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448436862] [2019-12-19 05:19:51,098 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:51,098 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:19:51,099 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144729639] [2019-12-19 05:19:51,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:19:51,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:51,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:19:51,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:51,123 INFO L87 Difference]: Start difference. First operand 22509 states. Second operand 4 states. [2019-12-19 05:19:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:51,727 INFO L93 Difference]: Finished difference Result 23453 states and 91770 transitions. [2019-12-19 05:19:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:19:51,729 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-12-19 05:19:51,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:51,941 INFO L225 Difference]: With dead ends: 23453 [2019-12-19 05:19:51,941 INFO L226 Difference]: Without dead ends: 21277 [2019-12-19 05:19:51,950 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:19:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21277 states. [2019-12-19 05:19:53,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21277 to 21277. [2019-12-19 05:19:53,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21277 states. [2019-12-19 05:19:54,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21277 states to 21277 states and 83794 transitions. [2019-12-19 05:19:54,120 INFO L78 Accepts]: Start accepts. Automaton has 21277 states and 83794 transitions. Word has length 32 [2019-12-19 05:19:54,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:54,120 INFO L462 AbstractCegarLoop]: Abstraction has 21277 states and 83794 transitions. [2019-12-19 05:19:54,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:19:54,121 INFO L276 IsEmpty]: Start isEmpty. Operand 21277 states and 83794 transitions. [2019-12-19 05:19:54,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-19 05:19:54,135 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:54,135 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:54,135 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:54,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:54,136 INFO L82 PathProgramCache]: Analyzing trace with hash -2036668926, now seen corresponding path program 1 times [2019-12-19 05:19:54,136 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:54,137 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532879632] [2019-12-19 05:19:54,137 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:54,323 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-19 05:19:54,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532879632] [2019-12-19 05:19:54,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:54,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:54,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352411510] [2019-12-19 05:19:54,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:54,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:54,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:54,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:54,328 INFO L87 Difference]: Start difference. First operand 21277 states and 83794 transitions. Second operand 5 states. [2019-12-19 05:19:55,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:55,901 INFO L93 Difference]: Finished difference Result 34711 states and 129090 transitions. [2019-12-19 05:19:55,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:55,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-12-19 05:19:55,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:56,042 INFO L225 Difference]: With dead ends: 34711 [2019-12-19 05:19:56,042 INFO L226 Difference]: Without dead ends: 34567 [2019-12-19 05:19:56,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:56,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34567 states. [2019-12-19 05:19:58,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34567 to 33067. [2019-12-19 05:19:58,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33067 states. [2019-12-19 05:19:58,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33067 states to 33067 states and 123978 transitions. [2019-12-19 05:19:58,312 INFO L78 Accepts]: Start accepts. Automaton has 33067 states and 123978 transitions. Word has length 43 [2019-12-19 05:19:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:19:58,314 INFO L462 AbstractCegarLoop]: Abstraction has 33067 states and 123978 transitions. [2019-12-19 05:19:58,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:19:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 33067 states and 123978 transitions. [2019-12-19 05:19:58,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 05:19:58,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:19:58,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:19:58,558 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:19:58,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:19:58,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1802978339, now seen corresponding path program 1 times [2019-12-19 05:19:58,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:19:58,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236603310] [2019-12-19 05:19:58,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:19:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:19:58,754 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-19 05:19:58,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236603310] [2019-12-19 05:19:58,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:19:58,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:19:58,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653382112] [2019-12-19 05:19:58,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:19:58,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:19:58,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:19:58,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:19:58,758 INFO L87 Difference]: Start difference. First operand 33067 states and 123978 transitions. Second operand 5 states. [2019-12-19 05:19:59,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:19:59,357 INFO L93 Difference]: Finished difference Result 40219 states and 148647 transitions. [2019-12-19 05:19:59,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:19:59,357 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 05:19:59,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:19:59,534 INFO L225 Difference]: With dead ends: 40219 [2019-12-19 05:19:59,534 INFO L226 Difference]: Without dead ends: 40059 [2019-12-19 05:19:59,535 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:19:59,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40059 states. [2019-12-19 05:20:01,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40059 to 34640. [2019-12-19 05:20:01,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34640 states. [2019-12-19 05:20:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34640 states to 34640 states and 129274 transitions. [2019-12-19 05:20:01,996 INFO L78 Accepts]: Start accepts. Automaton has 34640 states and 129274 transitions. Word has length 44 [2019-12-19 05:20:01,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:01,996 INFO L462 AbstractCegarLoop]: Abstraction has 34640 states and 129274 transitions. [2019-12-19 05:20:01,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:01,997 INFO L276 IsEmpty]: Start isEmpty. Operand 34640 states and 129274 transitions. [2019-12-19 05:20:02,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 05:20:02,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:02,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:02,012 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:02,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:02,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1187379522, now seen corresponding path program 1 times [2019-12-19 05:20:02,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:02,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278140285] [2019-12-19 05:20:02,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:02,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:02,127 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-19 05:20:02,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278140285] [2019-12-19 05:20:02,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:02,128 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:02,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090289781] [2019-12-19 05:20:02,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:02,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:02,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:02,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:02,130 INFO L87 Difference]: Start difference. First operand 34640 states and 129274 transitions. Second operand 6 states. [2019-12-19 05:20:03,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:03,358 INFO L93 Difference]: Finished difference Result 45668 states and 166168 transitions. [2019-12-19 05:20:03,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:20:03,358 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-19 05:20:03,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:03,483 INFO L225 Difference]: With dead ends: 45668 [2019-12-19 05:20:03,483 INFO L226 Difference]: Without dead ends: 45524 [2019-12-19 05:20:03,484 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 05:20:03,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45524 states. [2019-12-19 05:20:05,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45524 to 33603. [2019-12-19 05:20:05,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33603 states. [2019-12-19 05:20:05,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33603 states to 33603 states and 125429 transitions. [2019-12-19 05:20:05,931 INFO L78 Accepts]: Start accepts. Automaton has 33603 states and 125429 transitions. Word has length 51 [2019-12-19 05:20:05,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:05,932 INFO L462 AbstractCegarLoop]: Abstraction has 33603 states and 125429 transitions. [2019-12-19 05:20:05,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:05,932 INFO L276 IsEmpty]: Start isEmpty. Operand 33603 states and 125429 transitions. [2019-12-19 05:20:05,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-19 05:20:05,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:05,967 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:05,967 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:05,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:05,968 INFO L82 PathProgramCache]: Analyzing trace with hash -2042153850, now seen corresponding path program 1 times [2019-12-19 05:20:05,968 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:05,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348785218] [2019-12-19 05:20:05,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:06,084 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-19 05:20:06,084 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348785218] [2019-12-19 05:20:06,085 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:06,085 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:06,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890598693] [2019-12-19 05:20:06,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:06,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:06,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:06,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:06,086 INFO L87 Difference]: Start difference. First operand 33603 states and 125429 transitions. Second operand 6 states. [2019-12-19 05:20:07,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:07,112 INFO L93 Difference]: Finished difference Result 46075 states and 167862 transitions. [2019-12-19 05:20:07,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 05:20:07,112 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 58 [2019-12-19 05:20:07,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:07,258 INFO L225 Difference]: With dead ends: 46075 [2019-12-19 05:20:07,258 INFO L226 Difference]: Without dead ends: 45835 [2019-12-19 05:20:07,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:20:07,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45835 states. [2019-12-19 05:20:07,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45835 to 39964. [2019-12-19 05:20:07,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39964 states. [2019-12-19 05:20:10,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39964 states to 39964 states and 147353 transitions. [2019-12-19 05:20:10,135 INFO L78 Accepts]: Start accepts. Automaton has 39964 states and 147353 transitions. Word has length 58 [2019-12-19 05:20:10,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:10,136 INFO L462 AbstractCegarLoop]: Abstraction has 39964 states and 147353 transitions. [2019-12-19 05:20:10,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:10,136 INFO L276 IsEmpty]: Start isEmpty. Operand 39964 states and 147353 transitions. [2019-12-19 05:20:10,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 05:20:10,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:10,171 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:10,172 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:10,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:10,172 INFO L82 PathProgramCache]: Analyzing trace with hash 1541499923, now seen corresponding path program 1 times [2019-12-19 05:20:10,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:10,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110171938] [2019-12-19 05:20:10,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:10,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:10,219 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-19 05:20:10,220 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110171938] [2019-12-19 05:20:10,220 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:10,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:10,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837923931] [2019-12-19 05:20:10,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:10,222 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:10,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:10,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:10,223 INFO L87 Difference]: Start difference. First operand 39964 states and 147353 transitions. Second operand 3 states. [2019-12-19 05:20:10,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:10,463 INFO L93 Difference]: Finished difference Result 50262 states and 182188 transitions. [2019-12-19 05:20:10,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:10,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2019-12-19 05:20:10,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:10,565 INFO L225 Difference]: With dead ends: 50262 [2019-12-19 05:20:10,566 INFO L226 Difference]: Without dead ends: 50262 [2019-12-19 05:20:10,566 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-19 05:20:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50262 states. [2019-12-19 05:20:11,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50262 to 43894. [2019-12-19 05:20:11,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43894 states. [2019-12-19 05:20:11,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43894 states to 43894 states and 160791 transitions. [2019-12-19 05:20:11,637 INFO L78 Accepts]: Start accepts. Automaton has 43894 states and 160791 transitions. Word has length 60 [2019-12-19 05:20:11,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:11,637 INFO L462 AbstractCegarLoop]: Abstraction has 43894 states and 160791 transitions. [2019-12-19 05:20:11,637 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:11,637 INFO L276 IsEmpty]: Start isEmpty. Operand 43894 states and 160791 transitions. [2019-12-19 05:20:11,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 05:20:11,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:11,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:11,675 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:11,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:11,676 INFO L82 PathProgramCache]: Analyzing trace with hash 1207224336, now seen corresponding path program 1 times [2019-12-19 05:20:11,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:11,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331198238] [2019-12-19 05:20:11,676 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:11,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:11,793 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-19 05:20:11,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331198238] [2019-12-19 05:20:11,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:11,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:11,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330051649] [2019-12-19 05:20:11,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:11,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:11,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:11,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:11,796 INFO L87 Difference]: Start difference. First operand 43894 states and 160791 transitions. Second operand 7 states. [2019-12-19 05:20:12,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:12,856 INFO L93 Difference]: Finished difference Result 55890 states and 200525 transitions. [2019-12-19 05:20:12,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:20:12,856 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-19 05:20:12,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:12,973 INFO L225 Difference]: With dead ends: 55890 [2019-12-19 05:20:12,973 INFO L226 Difference]: Without dead ends: 55650 [2019-12-19 05:20:12,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 05:20:13,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55650 states. [2019-12-19 05:20:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55650 to 45120. [2019-12-19 05:20:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45120 states. [2019-12-19 05:20:14,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45120 states to 45120 states and 164958 transitions. [2019-12-19 05:20:14,284 INFO L78 Accepts]: Start accepts. Automaton has 45120 states and 164958 transitions. Word has length 64 [2019-12-19 05:20:14,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:14,284 INFO L462 AbstractCegarLoop]: Abstraction has 45120 states and 164958 transitions. [2019-12-19 05:20:14,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:14,284 INFO L276 IsEmpty]: Start isEmpty. Operand 45120 states and 164958 transitions. [2019-12-19 05:20:14,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:20:14,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:14,322 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:14,323 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:14,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:14,323 INFO L82 PathProgramCache]: Analyzing trace with hash 2064437065, now seen corresponding path program 1 times [2019-12-19 05:20:14,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:14,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136996102] [2019-12-19 05:20:14,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:14,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:14,408 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-19 05:20:14,409 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136996102] [2019-12-19 05:20:14,409 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:14,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:14,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885633660] [2019-12-19 05:20:14,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:14,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:14,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:14,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:14,411 INFO L87 Difference]: Start difference. First operand 45120 states and 164958 transitions. Second operand 6 states. [2019-12-19 05:20:15,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:15,478 INFO L93 Difference]: Finished difference Result 62662 states and 223894 transitions. [2019-12-19 05:20:15,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:20:15,479 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-19 05:20:15,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:15,613 INFO L225 Difference]: With dead ends: 62662 [2019-12-19 05:20:15,613 INFO L226 Difference]: Without dead ends: 62518 [2019-12-19 05:20:15,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:20:15,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62518 states. [2019-12-19 05:20:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62518 to 48801. [2019-12-19 05:20:16,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48801 states. [2019-12-19 05:20:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48801 states to 48801 states and 177924 transitions. [2019-12-19 05:20:16,993 INFO L78 Accepts]: Start accepts. Automaton has 48801 states and 177924 transitions. Word has length 65 [2019-12-19 05:20:16,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:16,993 INFO L462 AbstractCegarLoop]: Abstraction has 48801 states and 177924 transitions. [2019-12-19 05:20:16,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:16,994 INFO L276 IsEmpty]: Start isEmpty. Operand 48801 states and 177924 transitions. [2019-12-19 05:20:17,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 05:20:17,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:17,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:17,033 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:17,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:17,034 INFO L82 PathProgramCache]: Analyzing trace with hash -978936533, now seen corresponding path program 2 times [2019-12-19 05:20:17,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:17,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521362169] [2019-12-19 05:20:17,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:17,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-19 05:20:17,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521362169] [2019-12-19 05:20:17,131 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:17,131 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:17,132 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977706504] [2019-12-19 05:20:17,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:17,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:17,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:17,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:17,133 INFO L87 Difference]: Start difference. First operand 48801 states and 177924 transitions. Second operand 7 states. [2019-12-19 05:20:18,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:18,258 INFO L93 Difference]: Finished difference Result 58785 states and 210668 transitions. [2019-12-19 05:20:18,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 05:20:18,258 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 05:20:18,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:18,371 INFO L225 Difference]: With dead ends: 58785 [2019-12-19 05:20:18,372 INFO L226 Difference]: Without dead ends: 58585 [2019-12-19 05:20:18,372 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 05:20:18,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58585 states. [2019-12-19 05:20:19,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58585 to 45998. [2019-12-19 05:20:19,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45998 states. [2019-12-19 05:20:19,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45998 states to 45998 states and 167829 transitions. [2019-12-19 05:20:19,650 INFO L78 Accepts]: Start accepts. Automaton has 45998 states and 167829 transitions. Word has length 65 [2019-12-19 05:20:19,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:19,650 INFO L462 AbstractCegarLoop]: Abstraction has 45998 states and 167829 transitions. [2019-12-19 05:20:19,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:19,650 INFO L276 IsEmpty]: Start isEmpty. Operand 45998 states and 167829 transitions. [2019-12-19 05:20:19,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:20:19,688 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:19,688 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:19,688 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 379551327, now seen corresponding path program 1 times [2019-12-19 05:20:19,689 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:19,689 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321180198] [2019-12-19 05:20:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:19,737 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-19 05:20:19,738 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321180198] [2019-12-19 05:20:19,738 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:19,738 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:19,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689260332] [2019-12-19 05:20:19,739 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:19,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:19,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:19,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:19,740 INFO L87 Difference]: Start difference. First operand 45998 states and 167829 transitions. Second operand 3 states. [2019-12-19 05:20:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:20,465 INFO L93 Difference]: Finished difference Result 61492 states and 224163 transitions. [2019-12-19 05:20:20,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:20,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 05:20:20,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:20,589 INFO L225 Difference]: With dead ends: 61492 [2019-12-19 05:20:20,589 INFO L226 Difference]: Without dead ends: 61492 [2019-12-19 05:20:20,589 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-19 05:20:20,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61492 states. [2019-12-19 05:20:21,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61492 to 53439. [2019-12-19 05:20:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53439 states. [2019-12-19 05:20:21,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53439 states to 53439 states and 195642 transitions. [2019-12-19 05:20:21,565 INFO L78 Accepts]: Start accepts. Automaton has 53439 states and 195642 transitions. Word has length 67 [2019-12-19 05:20:21,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:21,565 INFO L462 AbstractCegarLoop]: Abstraction has 53439 states and 195642 transitions. [2019-12-19 05:20:21,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:21,565 INFO L276 IsEmpty]: Start isEmpty. Operand 53439 states and 195642 transitions. [2019-12-19 05:20:21,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:20:21,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:21,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:21,623 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:21,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:21,624 INFO L82 PathProgramCache]: Analyzing trace with hash 1904207583, now seen corresponding path program 1 times [2019-12-19 05:20:21,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:21,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467530287] [2019-12-19 05:20:21,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:22,192 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-19 05:20:22,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467530287] [2019-12-19 05:20:22,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:22,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:22,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146389882] [2019-12-19 05:20:22,193 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:22,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:22,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:22,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:22,194 INFO L87 Difference]: Start difference. First operand 53439 states and 195642 transitions. Second operand 6 states. [2019-12-19 05:20:23,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:23,015 INFO L93 Difference]: Finished difference Result 65988 states and 238856 transitions. [2019-12-19 05:20:23,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:23,016 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-19 05:20:23,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:23,156 INFO L225 Difference]: With dead ends: 65988 [2019-12-19 05:20:23,156 INFO L226 Difference]: Without dead ends: 65344 [2019-12-19 05:20:23,156 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:23,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65344 states. [2019-12-19 05:20:24,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65344 to 56048. [2019-12-19 05:20:24,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56048 states. [2019-12-19 05:20:24,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56048 states to 56048 states and 204359 transitions. [2019-12-19 05:20:24,828 INFO L78 Accepts]: Start accepts. Automaton has 56048 states and 204359 transitions. Word has length 67 [2019-12-19 05:20:24,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:24,829 INFO L462 AbstractCegarLoop]: Abstraction has 56048 states and 204359 transitions. [2019-12-19 05:20:24,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:24,829 INFO L276 IsEmpty]: Start isEmpty. Operand 56048 states and 204359 transitions. [2019-12-19 05:20:24,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:20:24,873 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:24,873 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:24,873 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:24,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:24,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1429145696, now seen corresponding path program 1 times [2019-12-19 05:20:24,874 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:24,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273994178] [2019-12-19 05:20:24,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:24,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:24,977 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-19 05:20:24,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273994178] [2019-12-19 05:20:24,977 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:24,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:24,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096044728] [2019-12-19 05:20:24,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:24,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:24,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:24,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:24,979 INFO L87 Difference]: Start difference. First operand 56048 states and 204359 transitions. Second operand 7 states. [2019-12-19 05:20:26,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:26,201 INFO L93 Difference]: Finished difference Result 83036 states and 292787 transitions. [2019-12-19 05:20:26,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:20:26,201 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-19 05:20:26,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:26,396 INFO L225 Difference]: With dead ends: 83036 [2019-12-19 05:20:26,396 INFO L226 Difference]: Without dead ends: 83036 [2019-12-19 05:20:26,396 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:20:26,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83036 states. [2019-12-19 05:20:28,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83036 to 76085. [2019-12-19 05:20:28,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76085 states. [2019-12-19 05:20:28,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76085 states to 76085 states and 270654 transitions. [2019-12-19 05:20:28,308 INFO L78 Accepts]: Start accepts. Automaton has 76085 states and 270654 transitions. Word has length 67 [2019-12-19 05:20:28,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:28,308 INFO L462 AbstractCegarLoop]: Abstraction has 76085 states and 270654 transitions. [2019-12-19 05:20:28,308 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:28,308 INFO L276 IsEmpty]: Start isEmpty. Operand 76085 states and 270654 transitions. [2019-12-19 05:20:28,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 05:20:28,372 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:28,372 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:28,372 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:28,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:28,372 INFO L82 PathProgramCache]: Analyzing trace with hash -184381215, now seen corresponding path program 1 times [2019-12-19 05:20:28,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:28,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683386895] [2019-12-19 05:20:28,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:28,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:28,451 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-19 05:20:28,451 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683386895] [2019-12-19 05:20:28,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:28,452 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:28,453 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013369413] [2019-12-19 05:20:28,453 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:28,453 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:28,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:28,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:28,455 INFO L87 Difference]: Start difference. First operand 76085 states and 270654 transitions. Second operand 4 states. [2019-12-19 05:20:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:28,553 INFO L93 Difference]: Finished difference Result 17230 states and 54532 transitions. [2019-12-19 05:20:28,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:28,554 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 05:20:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:28,587 INFO L225 Difference]: With dead ends: 17230 [2019-12-19 05:20:28,587 INFO L226 Difference]: Without dead ends: 16752 [2019-12-19 05:20:28,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:28,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16752 states. [2019-12-19 05:20:28,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16752 to 16740. [2019-12-19 05:20:28,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16740 states. [2019-12-19 05:20:29,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16740 states to 16740 states and 53027 transitions. [2019-12-19 05:20:29,333 INFO L78 Accepts]: Start accepts. Automaton has 16740 states and 53027 transitions. Word has length 67 [2019-12-19 05:20:29,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:29,333 INFO L462 AbstractCegarLoop]: Abstraction has 16740 states and 53027 transitions. [2019-12-19 05:20:29,333 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:29,334 INFO L276 IsEmpty]: Start isEmpty. Operand 16740 states and 53027 transitions. [2019-12-19 05:20:29,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:20:29,351 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:29,351 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:29,351 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:29,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:29,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1457085175, now seen corresponding path program 1 times [2019-12-19 05:20:29,352 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:29,352 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507156976] [2019-12-19 05:20:29,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:29,418 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-19 05:20:29,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507156976] [2019-12-19 05:20:29,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:29,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:29,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354766973] [2019-12-19 05:20:29,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:29,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:29,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:29,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:29,421 INFO L87 Difference]: Start difference. First operand 16740 states and 53027 transitions. Second operand 4 states. [2019-12-19 05:20:29,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:29,701 INFO L93 Difference]: Finished difference Result 22104 states and 69108 transitions. [2019-12-19 05:20:29,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:29,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 77 [2019-12-19 05:20:29,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:29,734 INFO L225 Difference]: With dead ends: 22104 [2019-12-19 05:20:29,734 INFO L226 Difference]: Without dead ends: 22104 [2019-12-19 05:20:29,735 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:29,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22104 states. [2019-12-19 05:20:29,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22104 to 17616. [2019-12-19 05:20:29,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17616 states. [2019-12-19 05:20:29,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17616 states to 17616 states and 55586 transitions. [2019-12-19 05:20:29,997 INFO L78 Accepts]: Start accepts. Automaton has 17616 states and 55586 transitions. Word has length 77 [2019-12-19 05:20:29,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:29,998 INFO L462 AbstractCegarLoop]: Abstraction has 17616 states and 55586 transitions. [2019-12-19 05:20:29,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:29,998 INFO L276 IsEmpty]: Start isEmpty. Operand 17616 states and 55586 transitions. [2019-12-19 05:20:30,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-19 05:20:30,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:30,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:30,013 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:30,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:30,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1202348630, now seen corresponding path program 1 times [2019-12-19 05:20:30,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:30,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640059951] [2019-12-19 05:20:30,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:30,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:30,141 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-19 05:20:30,141 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640059951] [2019-12-19 05:20:30,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:30,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:20:30,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335728048] [2019-12-19 05:20:30,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:20:30,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:30,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:20:30,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:30,143 INFO L87 Difference]: Start difference. First operand 17616 states and 55586 transitions. Second operand 8 states. [2019-12-19 05:20:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:31,276 INFO L93 Difference]: Finished difference Result 19710 states and 61662 transitions. [2019-12-19 05:20:31,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-19 05:20:31,277 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 77 [2019-12-19 05:20:31,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:31,307 INFO L225 Difference]: With dead ends: 19710 [2019-12-19 05:20:31,307 INFO L226 Difference]: Without dead ends: 19662 [2019-12-19 05:20:31,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-19 05:20:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19662 states. [2019-12-19 05:20:31,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19662 to 15534. [2019-12-19 05:20:31,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15534 states. [2019-12-19 05:20:31,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15534 states to 15534 states and 49320 transitions. [2019-12-19 05:20:31,547 INFO L78 Accepts]: Start accepts. Automaton has 15534 states and 49320 transitions. Word has length 77 [2019-12-19 05:20:31,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:31,547 INFO L462 AbstractCegarLoop]: Abstraction has 15534 states and 49320 transitions. [2019-12-19 05:20:31,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:20:31,547 INFO L276 IsEmpty]: Start isEmpty. Operand 15534 states and 49320 transitions. [2019-12-19 05:20:31,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 05:20:31,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:31,561 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:31,561 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:31,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:31,561 INFO L82 PathProgramCache]: Analyzing trace with hash -155414719, now seen corresponding path program 1 times [2019-12-19 05:20:31,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:31,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075888017] [2019-12-19 05:20:31,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:31,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:31,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-19 05:20:31,608 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075888017] [2019-12-19 05:20:31,608 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:31,608 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:31,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195456129] [2019-12-19 05:20:31,609 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:31,609 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:31,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:31,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:31,609 INFO L87 Difference]: Start difference. First operand 15534 states and 49320 transitions. Second operand 3 states. [2019-12-19 05:20:31,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:31,848 INFO L93 Difference]: Finished difference Result 16798 states and 53033 transitions. [2019-12-19 05:20:31,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:31,849 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-12-19 05:20:31,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:31,877 INFO L225 Difference]: With dead ends: 16798 [2019-12-19 05:20:31,877 INFO L226 Difference]: Without dead ends: 16798 [2019-12-19 05:20:31,877 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-19 05:20:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16798 states. [2019-12-19 05:20:32,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16798 to 16150. [2019-12-19 05:20:32,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16150 states. [2019-12-19 05:20:32,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16150 states to 16150 states and 51134 transitions. [2019-12-19 05:20:32,118 INFO L78 Accepts]: Start accepts. Automaton has 16150 states and 51134 transitions. Word has length 78 [2019-12-19 05:20:32,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:32,118 INFO L462 AbstractCegarLoop]: Abstraction has 16150 states and 51134 transitions. [2019-12-19 05:20:32,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:32,118 INFO L276 IsEmpty]: Start isEmpty. Operand 16150 states and 51134 transitions. [2019-12-19 05:20:32,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:20:32,133 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:32,133 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:32,133 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:32,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:32,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2033602545, now seen corresponding path program 1 times [2019-12-19 05:20:32,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:32,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713146826] [2019-12-19 05:20:32,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:32,195 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-19 05:20:32,195 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713146826] [2019-12-19 05:20:32,195 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:32,196 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:32,196 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794737] [2019-12-19 05:20:32,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:32,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:32,197 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:32,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:32,197 INFO L87 Difference]: Start difference. First operand 16150 states and 51134 transitions. Second operand 4 states. [2019-12-19 05:20:32,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:32,620 INFO L93 Difference]: Finished difference Result 19318 states and 60264 transitions. [2019-12-19 05:20:32,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 05:20:32,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-12-19 05:20:32,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:32,649 INFO L225 Difference]: With dead ends: 19318 [2019-12-19 05:20:32,650 INFO L226 Difference]: Without dead ends: 19318 [2019-12-19 05:20:32,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:32,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19318 states. [2019-12-19 05:20:32,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19318 to 18295. [2019-12-19 05:20:32,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18295 states. [2019-12-19 05:20:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18295 states to 18295 states and 57380 transitions. [2019-12-19 05:20:32,905 INFO L78 Accepts]: Start accepts. Automaton has 18295 states and 57380 transitions. Word has length 79 [2019-12-19 05:20:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:32,906 INFO L462 AbstractCegarLoop]: Abstraction has 18295 states and 57380 transitions. [2019-12-19 05:20:32,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 18295 states and 57380 transitions. [2019-12-19 05:20:32,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-19 05:20:32,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:32,922 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:32,923 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:32,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:32,923 INFO L82 PathProgramCache]: Analyzing trace with hash 332862066, now seen corresponding path program 1 times [2019-12-19 05:20:32,923 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:32,923 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667761280] [2019-12-19 05:20:32,923 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:32,978 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-19 05:20:32,978 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667761280] [2019-12-19 05:20:32,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:32,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:32,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809038358] [2019-12-19 05:20:32,979 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:32,979 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:32,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:32,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:32,980 INFO L87 Difference]: Start difference. First operand 18295 states and 57380 transitions. Second operand 3 states. [2019-12-19 05:20:33,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:33,301 INFO L93 Difference]: Finished difference Result 19638 states and 61303 transitions. [2019-12-19 05:20:33,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:33,301 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-12-19 05:20:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:33,342 INFO L225 Difference]: With dead ends: 19638 [2019-12-19 05:20:33,343 INFO L226 Difference]: Without dead ends: 19638 [2019-12-19 05:20:33,343 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-19 05:20:33,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19638 states. [2019-12-19 05:20:33,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19638 to 18975. [2019-12-19 05:20:33,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18975 states. [2019-12-19 05:20:33,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18975 states to 18975 states and 59360 transitions. [2019-12-19 05:20:33,618 INFO L78 Accepts]: Start accepts. Automaton has 18975 states and 59360 transitions. Word has length 79 [2019-12-19 05:20:33,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:33,618 INFO L462 AbstractCegarLoop]: Abstraction has 18975 states and 59360 transitions. [2019-12-19 05:20:33,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 18975 states and 59360 transitions. [2019-12-19 05:20:33,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:33,635 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:33,635 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:33,636 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:33,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:33,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1580742388, now seen corresponding path program 1 times [2019-12-19 05:20:33,638 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:33,639 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634321971] [2019-12-19 05:20:33,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:33,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:33,732 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-19 05:20:33,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634321971] [2019-12-19 05:20:33,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:33,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:20:33,733 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561285467] [2019-12-19 05:20:33,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:20:33,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:33,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:20:33,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:33,734 INFO L87 Difference]: Start difference. First operand 18975 states and 59360 transitions. Second operand 8 states. [2019-12-19 05:20:37,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:37,015 INFO L93 Difference]: Finished difference Result 52657 states and 160091 transitions. [2019-12-19 05:20:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 05:20:37,016 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-19 05:20:37,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:37,163 INFO L225 Difference]: With dead ends: 52657 [2019-12-19 05:20:37,164 INFO L226 Difference]: Without dead ends: 52240 [2019-12-19 05:20:37,166 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-19 05:20:37,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52240 states. [2019-12-19 05:20:38,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52240 to 28682. [2019-12-19 05:20:38,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28682 states. [2019-12-19 05:20:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28682 states to 28682 states and 89258 transitions. [2019-12-19 05:20:38,355 INFO L78 Accepts]: Start accepts. Automaton has 28682 states and 89258 transitions. Word has length 80 [2019-12-19 05:20:38,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:38,356 INFO L462 AbstractCegarLoop]: Abstraction has 28682 states and 89258 transitions. [2019-12-19 05:20:38,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:20:38,356 INFO L276 IsEmpty]: Start isEmpty. Operand 28682 states and 89258 transitions. [2019-12-19 05:20:38,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:38,404 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:38,405 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:38,405 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:38,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:38,405 INFO L82 PathProgramCache]: Analyzing trace with hash -507846410, now seen corresponding path program 1 times [2019-12-19 05:20:38,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:38,406 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440974515] [2019-12-19 05:20:38,406 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:38,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:38,565 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-19 05:20:38,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440974515] [2019-12-19 05:20:38,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:38,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:38,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127513136] [2019-12-19 05:20:38,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:38,568 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:38,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:38,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:38,569 INFO L87 Difference]: Start difference. First operand 28682 states and 89258 transitions. Second operand 6 states. [2019-12-19 05:20:39,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:39,104 INFO L93 Difference]: Finished difference Result 30407 states and 93751 transitions. [2019-12-19 05:20:39,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:39,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 80 [2019-12-19 05:20:39,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:39,148 INFO L225 Difference]: With dead ends: 30407 [2019-12-19 05:20:39,148 INFO L226 Difference]: Without dead ends: 30407 [2019-12-19 05:20:39,148 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:39,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30407 states. [2019-12-19 05:20:39,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30407 to 29149. [2019-12-19 05:20:39,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29149 states. [2019-12-19 05:20:39,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29149 states to 29149 states and 90160 transitions. [2019-12-19 05:20:39,532 INFO L78 Accepts]: Start accepts. Automaton has 29149 states and 90160 transitions. Word has length 80 [2019-12-19 05:20:39,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:39,533 INFO L462 AbstractCegarLoop]: Abstraction has 29149 states and 90160 transitions. [2019-12-19 05:20:39,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:39,533 INFO L276 IsEmpty]: Start isEmpty. Operand 29149 states and 90160 transitions. [2019-12-19 05:20:39,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:39,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:39,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:39,558 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:39,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:39,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1851460599, now seen corresponding path program 1 times [2019-12-19 05:20:39,558 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:39,559 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [676378119] [2019-12-19 05:20:39,559 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:39,636 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-19 05:20:39,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [676378119] [2019-12-19 05:20:39,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:39,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:39,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190730359] [2019-12-19 05:20:39,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:39,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:39,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:39,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:39,638 INFO L87 Difference]: Start difference. First operand 29149 states and 90160 transitions. Second operand 7 states. [2019-12-19 05:20:40,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:40,222 INFO L93 Difference]: Finished difference Result 30834 states and 94868 transitions. [2019-12-19 05:20:40,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 05:20:40,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-19 05:20:40,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:40,271 INFO L225 Difference]: With dead ends: 30834 [2019-12-19 05:20:40,271 INFO L226 Difference]: Without dead ends: 30834 [2019-12-19 05:20:40,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:20:40,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30834 states. [2019-12-19 05:20:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30834 to 29512. [2019-12-19 05:20:40,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29512 states. [2019-12-19 05:20:40,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29512 states to 29512 states and 91025 transitions. [2019-12-19 05:20:40,836 INFO L78 Accepts]: Start accepts. Automaton has 29512 states and 91025 transitions. Word has length 80 [2019-12-19 05:20:40,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:40,836 INFO L462 AbstractCegarLoop]: Abstraction has 29512 states and 91025 transitions. [2019-12-19 05:20:40,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:40,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29512 states and 91025 transitions. [2019-12-19 05:20:40,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:40,863 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:40,864 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:40,864 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:40,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:40,864 INFO L82 PathProgramCache]: Analyzing trace with hash -2113740936, now seen corresponding path program 1 times [2019-12-19 05:20:40,864 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:40,865 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961164669] [2019-12-19 05:20:40,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:40,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:40,915 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-19 05:20:40,915 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961164669] [2019-12-19 05:20:40,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:40,916 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 05:20:40,916 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234202353] [2019-12-19 05:20:40,916 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 05:20:40,916 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:40,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 05:20:40,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:40,917 INFO L87 Difference]: Start difference. First operand 29512 states and 91025 transitions. Second operand 3 states. [2019-12-19 05:20:41,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:41,020 INFO L93 Difference]: Finished difference Result 22465 states and 68730 transitions. [2019-12-19 05:20:41,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 05:20:41,021 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-19 05:20:41,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:41,052 INFO L225 Difference]: With dead ends: 22465 [2019-12-19 05:20:41,052 INFO L226 Difference]: Without dead ends: 22465 [2019-12-19 05:20:41,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 05:20:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22465 states. [2019-12-19 05:20:41,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22465 to 21651. [2019-12-19 05:20:41,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21651 states. [2019-12-19 05:20:41,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21651 states to 21651 states and 66414 transitions. [2019-12-19 05:20:41,348 INFO L78 Accepts]: Start accepts. Automaton has 21651 states and 66414 transitions. Word has length 80 [2019-12-19 05:20:41,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:41,349 INFO L462 AbstractCegarLoop]: Abstraction has 21651 states and 66414 transitions. [2019-12-19 05:20:41,349 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 05:20:41,349 INFO L276 IsEmpty]: Start isEmpty. Operand 21651 states and 66414 transitions. [2019-12-19 05:20:41,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:41,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:41,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:41,371 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:41,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:41,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1936604585, now seen corresponding path program 1 times [2019-12-19 05:20:41,371 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:41,371 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277453698] [2019-12-19 05:20:41,371 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:41,460 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-19 05:20:41,461 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277453698] [2019-12-19 05:20:41,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:41,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:41,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251929074] [2019-12-19 05:20:41,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:41,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:41,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:41,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:41,462 INFO L87 Difference]: Start difference. First operand 21651 states and 66414 transitions. Second operand 7 states. [2019-12-19 05:20:42,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:42,340 INFO L93 Difference]: Finished difference Result 39045 states and 119676 transitions. [2019-12-19 05:20:42,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:20:42,341 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2019-12-19 05:20:42,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:42,399 INFO L225 Difference]: With dead ends: 39045 [2019-12-19 05:20:42,399 INFO L226 Difference]: Without dead ends: 39045 [2019-12-19 05:20:42,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-19 05:20:42,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39045 states. [2019-12-19 05:20:42,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39045 to 23068. [2019-12-19 05:20:42,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23068 states. [2019-12-19 05:20:42,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23068 states to 23068 states and 70714 transitions. [2019-12-19 05:20:42,810 INFO L78 Accepts]: Start accepts. Automaton has 23068 states and 70714 transitions. Word has length 80 [2019-12-19 05:20:42,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:42,811 INFO L462 AbstractCegarLoop]: Abstraction has 23068 states and 70714 transitions. [2019-12-19 05:20:42,811 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:42,811 INFO L276 IsEmpty]: Start isEmpty. Operand 23068 states and 70714 transitions. [2019-12-19 05:20:42,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-19 05:20:42,831 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:42,831 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:42,831 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:42,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:42,832 INFO L82 PathProgramCache]: Analyzing trace with hash -632881814, now seen corresponding path program 1 times [2019-12-19 05:20:42,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:42,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939870170] [2019-12-19 05:20:42,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:42,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:42,913 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-19 05:20:42,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939870170] [2019-12-19 05:20:42,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:42,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:42,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779805403] [2019-12-19 05:20:42,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:42,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:42,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:42,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:42,915 INFO L87 Difference]: Start difference. First operand 23068 states and 70714 transitions. Second operand 5 states. [2019-12-19 05:20:42,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:42,959 INFO L93 Difference]: Finished difference Result 3274 states and 8033 transitions. [2019-12-19 05:20:42,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:20:42,960 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 80 [2019-12-19 05:20:42,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:42,963 INFO L225 Difference]: With dead ends: 3274 [2019-12-19 05:20:42,964 INFO L226 Difference]: Without dead ends: 2815 [2019-12-19 05:20:42,964 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:42,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2815 states. [2019-12-19 05:20:42,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2815 to 2541. [2019-12-19 05:20:42,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2541 states. [2019-12-19 05:20:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2541 states to 2541 states and 6203 transitions. [2019-12-19 05:20:43,001 INFO L78 Accepts]: Start accepts. Automaton has 2541 states and 6203 transitions. Word has length 80 [2019-12-19 05:20:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:43,001 INFO L462 AbstractCegarLoop]: Abstraction has 2541 states and 6203 transitions. [2019-12-19 05:20:43,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2541 states and 6203 transitions. [2019-12-19 05:20:43,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:43,004 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:43,005 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:43,005 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:43,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:43,005 INFO L82 PathProgramCache]: Analyzing trace with hash 211784789, now seen corresponding path program 1 times [2019-12-19 05:20:43,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:43,006 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731307262] [2019-12-19 05:20:43,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:43,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-19 05:20:43,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731307262] [2019-12-19 05:20:43,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:43,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:43,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146232876] [2019-12-19 05:20:43,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:43,076 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:43,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:43,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:43,076 INFO L87 Difference]: Start difference. First operand 2541 states and 6203 transitions. Second operand 6 states. [2019-12-19 05:20:43,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:43,370 INFO L93 Difference]: Finished difference Result 3131 states and 7603 transitions. [2019-12-19 05:20:43,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:43,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:43,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:43,376 INFO L225 Difference]: With dead ends: 3131 [2019-12-19 05:20:43,376 INFO L226 Difference]: Without dead ends: 3113 [2019-12-19 05:20:43,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:43,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2019-12-19 05:20:43,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 2790. [2019-12-19 05:20:43,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-12-19 05:20:43,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 6803 transitions. [2019-12-19 05:20:43,405 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 6803 transitions. Word has length 92 [2019-12-19 05:20:43,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:43,405 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 6803 transitions. [2019-12-19 05:20:43,405 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:43,405 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 6803 transitions. [2019-12-19 05:20:43,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:43,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:43,408 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:43,408 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:43,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:43,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1173398806, now seen corresponding path program 1 times [2019-12-19 05:20:43,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:43,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251296789] [2019-12-19 05:20:43,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:43,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:43,486 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-19 05:20:43,487 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251296789] [2019-12-19 05:20:43,487 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:43,487 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:43,487 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375481073] [2019-12-19 05:20:43,488 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:43,488 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:43,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:43,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:43,488 INFO L87 Difference]: Start difference. First operand 2790 states and 6803 transitions. Second operand 6 states. [2019-12-19 05:20:43,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:43,755 INFO L93 Difference]: Finished difference Result 2990 states and 7156 transitions. [2019-12-19 05:20:43,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:43,755 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:43,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:43,778 INFO L225 Difference]: With dead ends: 2990 [2019-12-19 05:20:43,778 INFO L226 Difference]: Without dead ends: 2938 [2019-12-19 05:20:43,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2938 states. [2019-12-19 05:20:43,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2938 to 2881. [2019-12-19 05:20:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2881 states. [2019-12-19 05:20:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2881 states to 2881 states and 6969 transitions. [2019-12-19 05:20:43,803 INFO L78 Accepts]: Start accepts. Automaton has 2881 states and 6969 transitions. Word has length 92 [2019-12-19 05:20:43,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:43,803 INFO L462 AbstractCegarLoop]: Abstraction has 2881 states and 6969 transitions. [2019-12-19 05:20:43,803 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:43,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2881 states and 6969 transitions. [2019-12-19 05:20:43,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:43,807 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:43,807 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:43,807 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:43,807 INFO L82 PathProgramCache]: Analyzing trace with hash 738198895, now seen corresponding path program 1 times [2019-12-19 05:20:43,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:43,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106453313] [2019-12-19 05:20:43,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:43,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:43,872 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-19 05:20:43,872 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106453313] [2019-12-19 05:20:43,872 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:43,872 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 05:20:43,873 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043602248] [2019-12-19 05:20:43,873 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 05:20:43,874 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:43,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 05:20:43,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 05:20:43,875 INFO L87 Difference]: Start difference. First operand 2881 states and 6969 transitions. Second operand 4 states. [2019-12-19 05:20:43,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:43,911 INFO L93 Difference]: Finished difference Result 2703 states and 6512 transitions. [2019-12-19 05:20:43,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:43,912 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-12-19 05:20:43,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:43,916 INFO L225 Difference]: With dead ends: 2703 [2019-12-19 05:20:43,916 INFO L226 Difference]: Without dead ends: 2703 [2019-12-19 05:20:43,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:43,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2703 states. [2019-12-19 05:20:43,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2703 to 2624. [2019-12-19 05:20:43,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-12-19 05:20:43,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 6310 transitions. [2019-12-19 05:20:43,955 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 6310 transitions. Word has length 92 [2019-12-19 05:20:43,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:43,955 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 6310 transitions. [2019-12-19 05:20:43,955 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 05:20:43,955 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 6310 transitions. [2019-12-19 05:20:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:43,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:43,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:43,960 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:43,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:43,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1220152845, now seen corresponding path program 1 times [2019-12-19 05:20:43,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:43,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243964506] [2019-12-19 05:20:43,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:44,049 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-19 05:20:44,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243964506] [2019-12-19 05:20:44,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:44,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:44,050 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566686460] [2019-12-19 05:20:44,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:44,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:44,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:44,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:44,051 INFO L87 Difference]: Start difference. First operand 2624 states and 6310 transitions. Second operand 5 states. [2019-12-19 05:20:44,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:44,330 INFO L93 Difference]: Finished difference Result 3041 states and 7197 transitions. [2019-12-19 05:20:44,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 05:20:44,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:20:44,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:44,335 INFO L225 Difference]: With dead ends: 3041 [2019-12-19 05:20:44,335 INFO L226 Difference]: Without dead ends: 3015 [2019-12-19 05:20:44,335 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:44,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3015 states. [2019-12-19 05:20:44,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3015 to 2695. [2019-12-19 05:20:44,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2695 states. [2019-12-19 05:20:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2695 states to 2695 states and 6452 transitions. [2019-12-19 05:20:44,392 INFO L78 Accepts]: Start accepts. Automaton has 2695 states and 6452 transitions. Word has length 92 [2019-12-19 05:20:44,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:44,392 INFO L462 AbstractCegarLoop]: Abstraction has 2695 states and 6452 transitions. [2019-12-19 05:20:44,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:44,393 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 6452 transitions. [2019-12-19 05:20:44,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:44,398 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:44,398 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:44,398 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:44,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:44,399 INFO L82 PathProgramCache]: Analyzing trace with hash -947481435, now seen corresponding path program 2 times [2019-12-19 05:20:44,399 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:44,399 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289656232] [2019-12-19 05:20:44,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:44,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:44,563 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-19 05:20:44,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289656232] [2019-12-19 05:20:44,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:44,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:44,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830765905] [2019-12-19 05:20:44,565 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:44,565 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:44,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:44,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:44,566 INFO L87 Difference]: Start difference. First operand 2695 states and 6452 transitions. Second operand 7 states. [2019-12-19 05:20:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:44,951 INFO L93 Difference]: Finished difference Result 3871 states and 9108 transitions. [2019-12-19 05:20:44,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 05:20:44,952 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:20:44,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:44,957 INFO L225 Difference]: With dead ends: 3871 [2019-12-19 05:20:44,957 INFO L226 Difference]: Without dead ends: 3853 [2019-12-19 05:20:44,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-19 05:20:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3853 states. [2019-12-19 05:20:44,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3853 to 3378. [2019-12-19 05:20:44,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3378 states. [2019-12-19 05:20:44,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3378 states to 3378 states and 7977 transitions. [2019-12-19 05:20:44,993 INFO L78 Accepts]: Start accepts. Automaton has 3378 states and 7977 transitions. Word has length 92 [2019-12-19 05:20:44,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:44,994 INFO L462 AbstractCegarLoop]: Abstraction has 3378 states and 7977 transitions. [2019-12-19 05:20:44,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:44,994 INFO L276 IsEmpty]: Start isEmpty. Operand 3378 states and 7977 transitions. [2019-12-19 05:20:44,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:44,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:44,998 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:44,998 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:44,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:44,998 INFO L82 PathProgramCache]: Analyzing trace with hash 14132582, now seen corresponding path program 1 times [2019-12-19 05:20:44,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:44,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982549005] [2019-12-19 05:20:44,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:45,095 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-19 05:20:45,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982549005] [2019-12-19 05:20:45,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:45,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 05:20:45,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772442821] [2019-12-19 05:20:45,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 05:20:45,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:45,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 05:20:45,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:45,097 INFO L87 Difference]: Start difference. First operand 3378 states and 7977 transitions. Second operand 7 states. [2019-12-19 05:20:45,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:45,457 INFO L93 Difference]: Finished difference Result 4287 states and 10155 transitions. [2019-12-19 05:20:45,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:20:45,457 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 92 [2019-12-19 05:20:45,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:45,463 INFO L225 Difference]: With dead ends: 4287 [2019-12-19 05:20:45,463 INFO L226 Difference]: Without dead ends: 4287 [2019-12-19 05:20:45,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-19 05:20:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4287 states. [2019-12-19 05:20:45,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4287 to 3600. [2019-12-19 05:20:45,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3600 states. [2019-12-19 05:20:45,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3600 states to 3600 states and 8531 transitions. [2019-12-19 05:20:45,501 INFO L78 Accepts]: Start accepts. Automaton has 3600 states and 8531 transitions. Word has length 92 [2019-12-19 05:20:45,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:45,502 INFO L462 AbstractCegarLoop]: Abstraction has 3600 states and 8531 transitions. [2019-12-19 05:20:45,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 05:20:45,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3600 states and 8531 transitions. [2019-12-19 05:20:45,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:45,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:45,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:45,505 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:45,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:45,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1258897063, now seen corresponding path program 1 times [2019-12-19 05:20:45,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:45,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038552621] [2019-12-19 05:20:45,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:45,606 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-19 05:20:45,606 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038552621] [2019-12-19 05:20:45,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:45,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:45,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803624911] [2019-12-19 05:20:45,607 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:45,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:45,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:45,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:45,608 INFO L87 Difference]: Start difference. First operand 3600 states and 8531 transitions. Second operand 6 states. [2019-12-19 05:20:45,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:45,956 INFO L93 Difference]: Finished difference Result 3968 states and 9363 transitions. [2019-12-19 05:20:45,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 05:20:45,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:45,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:45,964 INFO L225 Difference]: With dead ends: 3968 [2019-12-19 05:20:45,965 INFO L226 Difference]: Without dead ends: 3968 [2019-12-19 05:20:45,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:45,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3968 states. [2019-12-19 05:20:46,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3968 to 3572. [2019-12-19 05:20:46,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3572 states. [2019-12-19 05:20:46,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3572 states to 3572 states and 8475 transitions. [2019-12-19 05:20:46,043 INFO L78 Accepts]: Start accepts. Automaton has 3572 states and 8475 transitions. Word has length 92 [2019-12-19 05:20:46,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:46,043 INFO L462 AbstractCegarLoop]: Abstraction has 3572 states and 8475 transitions. [2019-12-19 05:20:46,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:46,044 INFO L276 IsEmpty]: Start isEmpty. Operand 3572 states and 8475 transitions. [2019-12-19 05:20:46,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:46,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:46,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:46,051 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:46,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:46,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1311094677, now seen corresponding path program 1 times [2019-12-19 05:20:46,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:46,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109399018] [2019-12-19 05:20:46,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:46,185 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-19 05:20:46,186 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109399018] [2019-12-19 05:20:46,186 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:46,186 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:46,187 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075068560] [2019-12-19 05:20:46,187 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:46,187 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:46,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:46,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:46,188 INFO L87 Difference]: Start difference. First operand 3572 states and 8475 transitions. Second operand 6 states. [2019-12-19 05:20:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:46,438 INFO L93 Difference]: Finished difference Result 4056 states and 9312 transitions. [2019-12-19 05:20:46,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 05:20:46,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:46,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:46,444 INFO L225 Difference]: With dead ends: 4056 [2019-12-19 05:20:46,444 INFO L226 Difference]: Without dead ends: 4056 [2019-12-19 05:20:46,444 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 05:20:46,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-19 05:20:46,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 3770. [2019-12-19 05:20:46,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3770 states. [2019-12-19 05:20:46,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3770 states to 3770 states and 8757 transitions. [2019-12-19 05:20:46,506 INFO L78 Accepts]: Start accepts. Automaton has 3770 states and 8757 transitions. Word has length 92 [2019-12-19 05:20:46,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:46,506 INFO L462 AbstractCegarLoop]: Abstraction has 3770 states and 8757 transitions. [2019-12-19 05:20:46,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:46,507 INFO L276 IsEmpty]: Start isEmpty. Operand 3770 states and 8757 transitions. [2019-12-19 05:20:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:46,512 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:46,512 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:46,512 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:46,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:46,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1187021430, now seen corresponding path program 1 times [2019-12-19 05:20:46,513 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:46,513 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100201035] [2019-12-19 05:20:46,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:46,628 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-19 05:20:46,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100201035] [2019-12-19 05:20:46,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:46,629 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 05:20:46,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890533462] [2019-12-19 05:20:46,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 05:20:46,630 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 05:20:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:46,631 INFO L87 Difference]: Start difference. First operand 3770 states and 8757 transitions. Second operand 8 states. [2019-12-19 05:20:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:47,148 INFO L93 Difference]: Finished difference Result 4626 states and 10717 transitions. [2019-12-19 05:20:47,148 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 05:20:47,149 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 92 [2019-12-19 05:20:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:47,154 INFO L225 Difference]: With dead ends: 4626 [2019-12-19 05:20:47,154 INFO L226 Difference]: Without dead ends: 4608 [2019-12-19 05:20:47,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=139, Unknown=0, NotChecked=0, Total=182 [2019-12-19 05:20:47,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2019-12-19 05:20:47,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3251. [2019-12-19 05:20:47,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3251 states. [2019-12-19 05:20:47,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3251 states to 3251 states and 7643 transitions. [2019-12-19 05:20:47,192 INFO L78 Accepts]: Start accepts. Automaton has 3251 states and 7643 transitions. Word has length 92 [2019-12-19 05:20:47,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:47,192 INFO L462 AbstractCegarLoop]: Abstraction has 3251 states and 7643 transitions. [2019-12-19 05:20:47,192 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 05:20:47,192 INFO L276 IsEmpty]: Start isEmpty. Operand 3251 states and 7643 transitions. [2019-12-19 05:20:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:47,196 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:47,196 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:47,197 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:47,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:47,197 INFO L82 PathProgramCache]: Analyzing trace with hash 1019357068, now seen corresponding path program 1 times [2019-12-19 05:20:47,197 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:47,197 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568097366] [2019-12-19 05:20:47,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:47,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:47,300 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-19 05:20:47,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568097366] [2019-12-19 05:20:47,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:47,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:47,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002436689] [2019-12-19 05:20:47,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:47,301 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:47,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:47,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:47,302 INFO L87 Difference]: Start difference. First operand 3251 states and 7643 transitions. Second operand 5 states. [2019-12-19 05:20:47,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:47,353 INFO L93 Difference]: Finished difference Result 4760 states and 11424 transitions. [2019-12-19 05:20:47,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 05:20:47,353 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 92 [2019-12-19 05:20:47,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:47,360 INFO L225 Difference]: With dead ends: 4760 [2019-12-19 05:20:47,360 INFO L226 Difference]: Without dead ends: 4760 [2019-12-19 05:20:47,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:47,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2019-12-19 05:20:47,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 2893. [2019-12-19 05:20:47,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2893 states. [2019-12-19 05:20:47,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2893 states to 2893 states and 6764 transitions. [2019-12-19 05:20:47,407 INFO L78 Accepts]: Start accepts. Automaton has 2893 states and 6764 transitions. Word has length 92 [2019-12-19 05:20:47,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:47,408 INFO L462 AbstractCegarLoop]: Abstraction has 2893 states and 6764 transitions. [2019-12-19 05:20:47,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:47,408 INFO L276 IsEmpty]: Start isEmpty. Operand 2893 states and 6764 transitions. [2019-12-19 05:20:47,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-12-19 05:20:47,410 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:47,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:47,411 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:47,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:47,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1500073484, now seen corresponding path program 1 times [2019-12-19 05:20:47,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:47,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150605638] [2019-12-19 05:20:47,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:47,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:47,507 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-19 05:20:47,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150605638] [2019-12-19 05:20:47,507 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:47,507 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 05:20:47,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620867029] [2019-12-19 05:20:47,508 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 05:20:47,508 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:47,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 05:20:47,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 05:20:47,509 INFO L87 Difference]: Start difference. First operand 2893 states and 6764 transitions. Second operand 6 states. [2019-12-19 05:20:47,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:47,687 INFO L93 Difference]: Finished difference Result 2650 states and 6062 transitions. [2019-12-19 05:20:47,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:20:47,688 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 92 [2019-12-19 05:20:47,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:47,692 INFO L225 Difference]: With dead ends: 2650 [2019-12-19 05:20:47,692 INFO L226 Difference]: Without dead ends: 2650 [2019-12-19 05:20:47,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 05:20:47,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2019-12-19 05:20:47,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2018. [2019-12-19 05:20:47,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2018 states. [2019-12-19 05:20:47,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2018 states to 2018 states and 4736 transitions. [2019-12-19 05:20:47,714 INFO L78 Accepts]: Start accepts. Automaton has 2018 states and 4736 transitions. Word has length 92 [2019-12-19 05:20:47,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:47,715 INFO L462 AbstractCegarLoop]: Abstraction has 2018 states and 4736 transitions. [2019-12-19 05:20:47,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 05:20:47,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2018 states and 4736 transitions. [2019-12-19 05:20:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:47,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:47,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:47,718 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:47,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:47,718 INFO L82 PathProgramCache]: Analyzing trace with hash -572704409, now seen corresponding path program 1 times [2019-12-19 05:20:47,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:47,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209356921] [2019-12-19 05:20:47,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:47,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:47,795 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-19 05:20:47,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209356921] [2019-12-19 05:20:47,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:47,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 05:20:47,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577949013] [2019-12-19 05:20:47,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 05:20:47,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:47,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 05:20:47,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 05:20:47,797 INFO L87 Difference]: Start difference. First operand 2018 states and 4736 transitions. Second operand 5 states. [2019-12-19 05:20:47,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:47,984 INFO L93 Difference]: Finished difference Result 2270 states and 5315 transitions. [2019-12-19 05:20:47,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 05:20:47,985 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 94 [2019-12-19 05:20:47,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:47,988 INFO L225 Difference]: With dead ends: 2270 [2019-12-19 05:20:47,989 INFO L226 Difference]: Without dead ends: 2252 [2019-12-19 05:20:47,990 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 05:20:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2252 states. [2019-12-19 05:20:48,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2252 to 2045. [2019-12-19 05:20:48,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-12-19 05:20:48,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 4790 transitions. [2019-12-19 05:20:48,011 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 4790 transitions. Word has length 94 [2019-12-19 05:20:48,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:48,011 INFO L462 AbstractCegarLoop]: Abstraction has 2045 states and 4790 transitions. [2019-12-19 05:20:48,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 05:20:48,011 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 4790 transitions. [2019-12-19 05:20:48,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:48,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:48,013 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:48,013 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:48,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:48,013 INFO L82 PathProgramCache]: Analyzing trace with hash 672060072, now seen corresponding path program 1 times [2019-12-19 05:20:48,013 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:48,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194002440] [2019-12-19 05:20:48,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:48,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 05:20:48,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-19 05:20:48,180 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194002440] [2019-12-19 05:20:48,180 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 05:20:48,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-19 05:20:48,181 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480451317] [2019-12-19 05:20:48,182 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-19 05:20:48,182 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 05:20:48,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-19 05:20:48,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-12-19 05:20:48,183 INFO L87 Difference]: Start difference. First operand 2045 states and 4790 transitions. Second operand 12 states. [2019-12-19 05:20:48,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 05:20:48,448 INFO L93 Difference]: Finished difference Result 3214 states and 7655 transitions. [2019-12-19 05:20:48,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-19 05:20:48,455 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2019-12-19 05:20:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 05:20:48,458 INFO L225 Difference]: With dead ends: 3214 [2019-12-19 05:20:48,459 INFO L226 Difference]: Without dead ends: 2575 [2019-12-19 05:20:48,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-12-19 05:20:48,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2575 states. [2019-12-19 05:20:48,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2575 to 2463. [2019-12-19 05:20:48,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-19 05:20:48,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5707 transitions. [2019-12-19 05:20:48,493 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5707 transitions. Word has length 94 [2019-12-19 05:20:48,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 05:20:48,493 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5707 transitions. [2019-12-19 05:20:48,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-19 05:20:48,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5707 transitions. [2019-12-19 05:20:48,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-12-19 05:20:48,495 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 05:20:48,496 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 05:20:48,496 INFO L410 AbstractCegarLoop]: === Iteration 38 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 05:20:48,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 05:20:48,496 INFO L82 PathProgramCache]: Analyzing trace with hash 718924530, now seen corresponding path program 2 times [2019-12-19 05:20:48,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 05:20:48,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203891273] [2019-12-19 05:20:48,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 05:20:48,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:20:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 05:20:48,606 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 05:20:48,606 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 05:20:48,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 05:20:48 BasicIcfg [2019-12-19 05:20:48,825 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 05:20:48,827 INFO L168 Benchmark]: Toolchain (without parser) took 61315.21 ms. Allocated memory was 144.7 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 101.2 MB in the beginning and 849.7 MB in the end (delta: -748.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,827 INFO L168 Benchmark]: CDTParser took 0.83 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 809.55 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 156.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,828 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,829 INFO L168 Benchmark]: Boogie Preprocessor took 38.52 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,829 INFO L168 Benchmark]: RCFGBuilder took 846.08 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 107.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,829 INFO L168 Benchmark]: TraceAbstraction took 59542.13 ms. Allocated memory was 201.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.4 MB in the beginning and 849.7 MB in the end (delta: -743.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-19 05:20:48,832 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.83 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 809.55 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 100.8 MB in the beginning and 156.0 MB in the end (delta: -55.2 MB). Peak memory consumption was 21.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.63 ms. Allocated memory is still 201.9 MB. Free memory was 156.0 MB in the beginning and 153.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.52 ms. Allocated memory is still 201.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 846.08 ms. Allocated memory is still 201.9 MB. Free memory was 151.3 MB in the beginning and 107.0 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 59542.13 ms. Allocated memory was 201.9 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.4 MB in the beginning and 849.7 MB in the end (delta: -743.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L700] 0 int y = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L701] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L702] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L703] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L704] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L705] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L706] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L707] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L708] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L709] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L710] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L711] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L712] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L713] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L714] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 0 pthread_t t2477; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L777] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L720] 1 y$w_buff1 = y$w_buff0 [L721] 1 y$w_buff0 = 2 [L722] 1 y$w_buff1_used = y$w_buff0_used [L723] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L725] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L726] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L727] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L728] 1 y$r_buff0_thd1 = (_Bool)1 [L731] 1 x = 1 VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 0 pthread_t t2478; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L748] 2 x = 2 [L751] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L735] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L754] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L736] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L754] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L754] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L755] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L741] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L755] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L756] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L758] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L785] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L786] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L786] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L787] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L789] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 y$flush_delayed = weak$$choice2 [L795] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L797] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L797] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L798] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L799] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y = y$flush_delayed ? y$mem_tmp : y [L805] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 139 locations, 2 error locations. Result: UNSAFE, OverallTime: 59.1s, OverallIterations: 38, TraceHistogramMax: 1, AutomataDifference: 25.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10100 SDtfs, 10338 SDslu, 24185 SDs, 0 SdLazy, 11145 SolverSat, 657 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 413 GetRequests, 108 SyntacticMatches, 18 SemanticMatches, 287 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76085occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 27.2s AutomataMinimizationTime, 37 MinimizatonAttempts, 153176 StatesRemovedByMinimization, 36 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 2914 NumberOfCodeBlocks, 2914 NumberOfCodeBlocksAsserted, 38 NumberOfCheckSat, 2783 ConstructedInterpolants, 0 QuantifiedInterpolants, 526567 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 37 InterpolantComputations, 37 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 proved your program to be incorrect! Received shutdown request...