/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/rfi001_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 12:48:46,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 12:48:46,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 12:48:46,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 12:48:46,952 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 12:48:46,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 12:48:46,954 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 12:48:46,956 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 12:48:46,958 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 12:48:46,959 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 12:48:46,960 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 12:48:46,962 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 12:48:46,967 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 12:48:46,968 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 12:48:46,973 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 12:48:46,977 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 12:48:46,978 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 12:48:46,979 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 12:48:46,981 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 12:48:46,986 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 12:48:46,989 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 12:48:46,992 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 12:48:46,993 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 12:48:46,994 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 12:48:47,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 12:48:47,002 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 12:48:47,002 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 12:48:47,003 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 12:48:47,004 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 12:48:47,004 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 12:48:47,005 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 12:48:47,005 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 12:48:47,006 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 12:48:47,007 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 12:48:47,008 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 12:48:47,008 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 12:48:47,009 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 12:48:47,009 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 12:48:47,009 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 12:48:47,010 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 12:48:47,011 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 12:48:47,011 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-27 12:48:47,025 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 12:48:47,026 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 12:48:47,027 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 12:48:47,027 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 12:48:47,027 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 12:48:47,028 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 12:48:47,028 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 12:48:47,028 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 12:48:47,028 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 12:48:47,028 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 12:48:47,029 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 12:48:47,029 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 12:48:47,029 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 12:48:47,029 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 12:48:47,029 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 12:48:47,029 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 12:48:47,030 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 12:48:47,030 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 12:48:47,030 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 12:48:47,030 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 12:48:47,030 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 12:48:47,031 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:48:47,031 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 12:48:47,031 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 12:48:47,031 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 12:48:47,031 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 12:48:47,032 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 12:48:47,032 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 12:48:47,032 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 12:48:47,032 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 12:48:47,307 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 12:48:47,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 12:48:47,330 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 12:48:47,332 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 12:48:47,332 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 12:48:47,334 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 12:48:47,403 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe01c06/f142141695ab4a7082a9ab19732d5302/FLAG8b71f15f9 [2019-12-27 12:48:47,965 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 12:48:47,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_pso.opt.i [2019-12-27 12:48:47,985 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe01c06/f142141695ab4a7082a9ab19732d5302/FLAG8b71f15f9 [2019-12-27 12:48:48,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0ffe01c06/f142141695ab4a7082a9ab19732d5302 [2019-12-27 12:48:48,395 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 12:48:48,397 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 12:48:48,398 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 12:48:48,398 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 12:48:48,401 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 12:48:48,402 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:48:48" (1/1) ... [2019-12-27 12:48:48,405 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7760e6d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:48, skipping insertion in model container [2019-12-27 12:48:48,405 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 12:48:48" (1/1) ... [2019-12-27 12:48:48,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 12:48:48,480 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 12:48:48,992 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:48:49,010 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 12:48:49,089 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 12:48:49,181 INFO L208 MainTranslator]: Completed translation [2019-12-27 12:48:49,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49 WrapperNode [2019-12-27 12:48:49,182 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 12:48:49,182 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 12:48:49,183 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 12:48:49,183 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 12:48:49,191 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,215 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,261 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 12:48:49,261 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 12:48:49,261 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 12:48:49,261 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 12:48:49,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,277 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,287 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... [2019-12-27 12:48:49,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 12:48:49,300 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 12:48:49,300 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 12:48:49,300 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 12:48:49,301 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 12:48:49,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 12:48:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 12:48:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 12:48:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 12:48:49,371 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 12:48:49,371 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 12:48:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 12:48:49,372 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 12:48:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 12:48:49,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 12:48:49,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 12:48:49,374 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 12:48:50,045 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 12:48:50,045 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 12:48:50,047 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:48:50 BoogieIcfgContainer [2019-12-27 12:48:50,047 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 12:48:50,048 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 12:48:50,048 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 12:48:50,052 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 12:48:50,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 12:48:48" (1/3) ... [2019-12-27 12:48:50,053 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d6c593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:48:50, skipping insertion in model container [2019-12-27 12:48:50,053 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 12:48:49" (2/3) ... [2019-12-27 12:48:50,054 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39d6c593 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 12:48:50, skipping insertion in model container [2019-12-27 12:48:50,054 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 12:48:50" (3/3) ... [2019-12-27 12:48:50,056 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_pso.opt.i [2019-12-27 12:48:50,069 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 12:48:50,069 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 12:48:50,077 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 12:48:50,078 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 12:48:50,111 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,112 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,112 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,113 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,114 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,115 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,116 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,117 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,118 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,119 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,120 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,121 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,121 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,122 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,122 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,123 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,124 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,125 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,126 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,127 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,128 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,129 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,133 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,134 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,135 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,135 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,138 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,139 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,139 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,140 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,141 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 12:48:50,157 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 12:48:50,177 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 12:48:50,177 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 12:48:50,177 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 12:48:50,178 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 12:48:50,178 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 12:48:50,178 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 12:48:50,178 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 12:48:50,178 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 12:48:50,193 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 148 places, 182 transitions [2019-12-27 12:48:51,476 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22496 states. [2019-12-27 12:48:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 22496 states. [2019-12-27 12:48:51,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 12:48:51,489 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:51,490 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] [2019-12-27 12:48:51,491 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:51,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:51,498 INFO L82 PathProgramCache]: Analyzing trace with hash 1922426572, now seen corresponding path program 1 times [2019-12-27 12:48:51,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:51,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346445782] [2019-12-27 12:48:51,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:51,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:48:51,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346445782] [2019-12-27 12:48:51,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:51,840 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:48:51,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723632133] [2019-12-27 12:48:51,852 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:48:51,852 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:51,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:48:51,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:48:51,870 INFO L87 Difference]: Start difference. First operand 22496 states. Second operand 4 states. [2019-12-27 12:48:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:52,524 INFO L93 Difference]: Finished difference Result 23448 states and 91749 transitions. [2019-12-27 12:48:52,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 12:48:52,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2019-12-27 12:48:52,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:52,745 INFO L225 Difference]: With dead ends: 23448 [2019-12-27 12:48:52,745 INFO L226 Difference]: Without dead ends: 21272 [2019-12-27 12:48:52,752 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-27 12:48:53,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21272 states. [2019-12-27 12:48:54,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21272 to 21272. [2019-12-27 12:48:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21272 states. [2019-12-27 12:48:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21272 states to 21272 states and 83773 transitions. [2019-12-27 12:48:54,729 INFO L78 Accepts]: Start accepts. Automaton has 21272 states and 83773 transitions. Word has length 39 [2019-12-27 12:48:54,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:54,730 INFO L462 AbstractCegarLoop]: Abstraction has 21272 states and 83773 transitions. [2019-12-27 12:48:54,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:48:54,730 INFO L276 IsEmpty]: Start isEmpty. Operand 21272 states and 83773 transitions. [2019-12-27 12:48:54,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-27 12:48:54,741 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:54,741 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] [2019-12-27 12:48:54,742 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:54,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:54,743 INFO L82 PathProgramCache]: Analyzing trace with hash -184333443, now seen corresponding path program 1 times [2019-12-27 12:48:54,743 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:54,743 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146643542] [2019-12-27 12:48:54,743 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:54,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:54,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:48:54,929 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146643542] [2019-12-27 12:48:54,929 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:54,929 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:48:54,930 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774211441] [2019-12-27 12:48:54,931 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:48:54,932 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:54,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:48:54,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:54,933 INFO L87 Difference]: Start difference. First operand 21272 states and 83773 transitions. Second operand 5 states. [2019-12-27 12:48:57,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:57,030 INFO L93 Difference]: Finished difference Result 34706 states and 129065 transitions. [2019-12-27 12:48:57,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:48:57,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-27 12:48:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:57,178 INFO L225 Difference]: With dead ends: 34706 [2019-12-27 12:48:57,178 INFO L226 Difference]: Without dead ends: 34562 [2019-12-27 12:48:57,179 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-27 12:48:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34562 states. [2019-12-27 12:48:58,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34562 to 33062. [2019-12-27 12:48:58,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33062 states. [2019-12-27 12:48:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33062 states to 33062 states and 123953 transitions. [2019-12-27 12:48:58,425 INFO L78 Accepts]: Start accepts. Automaton has 33062 states and 123953 transitions. Word has length 46 [2019-12-27 12:48:58,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:48:58,428 INFO L462 AbstractCegarLoop]: Abstraction has 33062 states and 123953 transitions. [2019-12-27 12:48:58,428 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:48:58,428 INFO L276 IsEmpty]: Start isEmpty. Operand 33062 states and 123953 transitions. [2019-12-27 12:48:58,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-12-27 12:48:58,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:48:58,435 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] [2019-12-27 12:48:58,436 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:48:58,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:48:58,436 INFO L82 PathProgramCache]: Analyzing trace with hash -2043575512, now seen corresponding path program 1 times [2019-12-27 12:48:58,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:48:58,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661181213] [2019-12-27 12:48:58,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:48:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:48:58,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:48:58,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661181213] [2019-12-27 12:48:58,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:48:58,579 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:48:58,579 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685014359] [2019-12-27 12:48:58,580 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:48:58,580 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:48:58,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:48:58,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:48:58,581 INFO L87 Difference]: Start difference. First operand 33062 states and 123953 transitions. Second operand 5 states. [2019-12-27 12:48:59,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:48:59,396 INFO L93 Difference]: Finished difference Result 40214 states and 148622 transitions. [2019-12-27 12:48:59,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:48:59,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-12-27 12:48:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:48:59,607 INFO L225 Difference]: With dead ends: 40214 [2019-12-27 12:48:59,608 INFO L226 Difference]: Without dead ends: 40054 [2019-12-27 12:48:59,608 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-27 12:48:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40054 states. [2019-12-27 12:49:01,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40054 to 34635. [2019-12-27 12:49:01,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34635 states. [2019-12-27 12:49:02,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34635 states to 34635 states and 129249 transitions. [2019-12-27 12:49:02,048 INFO L78 Accepts]: Start accepts. Automaton has 34635 states and 129249 transitions. Word has length 47 [2019-12-27 12:49:02,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:02,048 INFO L462 AbstractCegarLoop]: Abstraction has 34635 states and 129249 transitions. [2019-12-27 12:49:02,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:02,048 INFO L276 IsEmpty]: Start isEmpty. Operand 34635 states and 129249 transitions. [2019-12-27 12:49:02,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 12:49:02,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:02,061 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] [2019-12-27 12:49:02,062 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:02,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:02,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1974753575, now seen corresponding path program 1 times [2019-12-27 12:49:02,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:02,063 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111185494] [2019-12-27 12:49:02,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:02,169 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:02,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111185494] [2019-12-27 12:49:02,170 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:02,170 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:49:02,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057494881] [2019-12-27 12:49:02,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:49:02,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:02,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:49:02,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:49:02,172 INFO L87 Difference]: Start difference. First operand 34635 states and 129249 transitions. Second operand 6 states. [2019-12-27 12:49:03,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:03,368 INFO L93 Difference]: Finished difference Result 45663 states and 166143 transitions. [2019-12-27 12:49:03,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 12:49:03,368 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 54 [2019-12-27 12:49:03,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:03,650 INFO L225 Difference]: With dead ends: 45663 [2019-12-27 12:49:03,650 INFO L226 Difference]: Without dead ends: 45519 [2019-12-27 12:49:03,660 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-27 12:49:03,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45519 states. [2019-12-27 12:49:05,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45519 to 33598. [2019-12-27 12:49:05,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33598 states. [2019-12-27 12:49:05,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33598 states to 33598 states and 125404 transitions. [2019-12-27 12:49:05,991 INFO L78 Accepts]: Start accepts. Automaton has 33598 states and 125404 transitions. Word has length 54 [2019-12-27 12:49:05,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:05,991 INFO L462 AbstractCegarLoop]: Abstraction has 33598 states and 125404 transitions. [2019-12-27 12:49:05,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:49:05,991 INFO L276 IsEmpty]: Start isEmpty. Operand 33598 states and 125404 transitions. [2019-12-27 12:49:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-27 12:49:06,022 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:06,022 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] [2019-12-27 12:49:06,022 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:06,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 194121141, now seen corresponding path program 1 times [2019-12-27 12:49:06,023 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:06,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046246233] [2019-12-27 12:49:06,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:06,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:06,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:06,155 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046246233] [2019-12-27 12:49:06,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:06,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:49:06,155 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029796480] [2019-12-27 12:49:06,156 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:49:06,156 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:06,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:49:06,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:49:06,157 INFO L87 Difference]: Start difference. First operand 33598 states and 125404 transitions. Second operand 6 states. [2019-12-27 12:49:07,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:07,083 INFO L93 Difference]: Finished difference Result 46070 states and 167837 transitions. [2019-12-27 12:49:07,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 12:49:07,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2019-12-27 12:49:07,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:07,177 INFO L225 Difference]: With dead ends: 46070 [2019-12-27 12:49:07,177 INFO L226 Difference]: Without dead ends: 45830 [2019-12-27 12:49:07,178 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-27 12:49:07,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45830 states. [2019-12-27 12:49:07,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45830 to 39959. [2019-12-27 12:49:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39959 states. [2019-12-27 12:49:09,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39959 states to 39959 states and 147328 transitions. [2019-12-27 12:49:09,840 INFO L78 Accepts]: Start accepts. Automaton has 39959 states and 147328 transitions. Word has length 61 [2019-12-27 12:49:09,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:09,840 INFO L462 AbstractCegarLoop]: Abstraction has 39959 states and 147328 transitions. [2019-12-27 12:49:09,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:49:09,840 INFO L276 IsEmpty]: Start isEmpty. Operand 39959 states and 147328 transitions. [2019-12-27 12:49:09,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-27 12:49:09,875 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:09,875 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] [2019-12-27 12:49:09,876 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:09,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:09,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1160701436, now seen corresponding path program 1 times [2019-12-27 12:49:09,876 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:09,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530802637] [2019-12-27 12:49:09,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:09,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:09,927 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530802637] [2019-12-27 12:49:09,927 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:09,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:49:09,928 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538526939] [2019-12-27 12:49:09,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:49:09,929 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:09,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:49:09,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:49:09,930 INFO L87 Difference]: Start difference. First operand 39959 states and 147328 transitions. Second operand 3 states. [2019-12-27 12:49:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:10,170 INFO L93 Difference]: Finished difference Result 50257 states and 182163 transitions. [2019-12-27 12:49:10,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:49:10,170 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-12-27 12:49:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:10,314 INFO L225 Difference]: With dead ends: 50257 [2019-12-27 12:49:10,315 INFO L226 Difference]: Without dead ends: 50257 [2019-12-27 12:49:10,315 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:49:10,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50257 states. [2019-12-27 12:49:11,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50257 to 43889. [2019-12-27 12:49:11,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43889 states. [2019-12-27 12:49:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43889 states to 43889 states and 160766 transitions. [2019-12-27 12:49:11,347 INFO L78 Accepts]: Start accepts. Automaton has 43889 states and 160766 transitions. Word has length 63 [2019-12-27 12:49:11,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:11,347 INFO L462 AbstractCegarLoop]: Abstraction has 43889 states and 160766 transitions. [2019-12-27 12:49:11,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:49:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 43889 states and 160766 transitions. [2019-12-27 12:49:11,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 12:49:11,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:11,380 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-27 12:49:11,381 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:11,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:11,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1771534722, now seen corresponding path program 1 times [2019-12-27 12:49:11,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:11,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447215442] [2019-12-27 12:49:11,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:11,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:11,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447215442] [2019-12-27 12:49:11,469 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:11,469 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:49:11,470 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382448580] [2019-12-27 12:49:11,470 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:49:11,470 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:11,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:49:11,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:11,471 INFO L87 Difference]: Start difference. First operand 43889 states and 160766 transitions. Second operand 7 states. [2019-12-27 12:49:12,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:12,540 INFO L93 Difference]: Finished difference Result 55885 states and 200500 transitions. [2019-12-27 12:49:12,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 12:49:12,540 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 12:49:12,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:13,136 INFO L225 Difference]: With dead ends: 55885 [2019-12-27 12:49:13,136 INFO L226 Difference]: Without dead ends: 55645 [2019-12-27 12:49:13,137 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-27 12:49:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55645 states. [2019-12-27 12:49:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55645 to 45115. [2019-12-27 12:49:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45115 states. [2019-12-27 12:49:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45115 states to 45115 states and 164933 transitions. [2019-12-27 12:49:13,982 INFO L78 Accepts]: Start accepts. Automaton has 45115 states and 164933 transitions. Word has length 67 [2019-12-27 12:49:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:13,982 INFO L462 AbstractCegarLoop]: Abstraction has 45115 states and 164933 transitions. [2019-12-27 12:49:13,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:49:13,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45115 states and 164933 transitions. [2019-12-27 12:49:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 12:49:14,019 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:14,020 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] [2019-12-27 12:49:14,020 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:14,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:14,020 INFO L82 PathProgramCache]: Analyzing trace with hash -93886554, now seen corresponding path program 1 times [2019-12-27 12:49:14,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:14,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855876599] [2019-12-27 12:49:14,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:14,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:14,111 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855876599] [2019-12-27 12:49:14,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:14,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:49:14,111 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287266662] [2019-12-27 12:49:14,113 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:49:14,113 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:14,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:49:14,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:14,114 INFO L87 Difference]: Start difference. First operand 45115 states and 164933 transitions. Second operand 7 states. [2019-12-27 12:49:16,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:16,635 INFO L93 Difference]: Finished difference Result 55099 states and 197677 transitions. [2019-12-27 12:49:16,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 12:49:16,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-27 12:49:16,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:16,754 INFO L225 Difference]: With dead ends: 55099 [2019-12-27 12:49:16,754 INFO L226 Difference]: Without dead ends: 54899 [2019-12-27 12:49:16,755 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-27 12:49:16,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54899 states. [2019-12-27 12:49:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54899 to 45993. [2019-12-27 12:49:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45993 states. [2019-12-27 12:49:17,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45993 states to 45993 states and 167804 transitions. [2019-12-27 12:49:17,911 INFO L78 Accepts]: Start accepts. Automaton has 45993 states and 167804 transitions. Word has length 68 [2019-12-27 12:49:17,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:17,912 INFO L462 AbstractCegarLoop]: Abstraction has 45993 states and 167804 transitions. [2019-12-27 12:49:17,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:49:17,912 INFO L276 IsEmpty]: Start isEmpty. Operand 45993 states and 167804 transitions. [2019-12-27 12:49:17,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 12:49:17,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:17,948 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] [2019-12-27 12:49:17,948 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:17,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash 796822408, now seen corresponding path program 1 times [2019-12-27 12:49:17,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:17,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760851534] [2019-12-27 12:49:17,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:18,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760851534] [2019-12-27 12:49:18,065 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:18,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:49:18,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202830409] [2019-12-27 12:49:18,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:49:18,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:18,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:49:18,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:49:18,067 INFO L87 Difference]: Start difference. First operand 45993 states and 167804 transitions. Second operand 6 states. [2019-12-27 12:49:18,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:18,978 INFO L93 Difference]: Finished difference Result 65553 states and 237331 transitions. [2019-12-27 12:49:18,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:49:18,979 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-27 12:49:18,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:19,119 INFO L225 Difference]: With dead ends: 65553 [2019-12-27 12:49:19,119 INFO L226 Difference]: Without dead ends: 64909 [2019-12-27 12:49:19,119 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-27 12:49:19,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64909 states. [2019-12-27 12:49:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64909 to 56043. [2019-12-27 12:49:20,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56043 states. [2019-12-27 12:49:20,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56043 states to 56043 states and 204334 transitions. [2019-12-27 12:49:20,796 INFO L78 Accepts]: Start accepts. Automaton has 56043 states and 204334 transitions. Word has length 70 [2019-12-27 12:49:20,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:20,796 INFO L462 AbstractCegarLoop]: Abstraction has 56043 states and 204334 transitions. [2019-12-27 12:49:20,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:49:20,796 INFO L276 IsEmpty]: Start isEmpty. Operand 56043 states and 204334 transitions. [2019-12-27 12:49:20,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 12:49:20,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:20,854 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] [2019-12-27 12:49:20,854 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:20,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:20,855 INFO L82 PathProgramCache]: Analyzing trace with hash 1758436425, now seen corresponding path program 1 times [2019-12-27 12:49:20,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:20,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922665983] [2019-12-27 12:49:20,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:20,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:20,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:20,949 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922665983] [2019-12-27 12:49:20,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:20,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:49:20,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591380742] [2019-12-27 12:49:20,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:49:20,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:20,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:49:20,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:20,951 INFO L87 Difference]: Start difference. First operand 56043 states and 204334 transitions. Second operand 7 states. [2019-12-27 12:49:22,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:22,480 INFO L93 Difference]: Finished difference Result 83031 states and 292762 transitions. [2019-12-27 12:49:22,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:49:22,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 12:49:22,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:22,651 INFO L225 Difference]: With dead ends: 83031 [2019-12-27 12:49:22,652 INFO L226 Difference]: Without dead ends: 83031 [2019-12-27 12:49:22,652 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-27 12:49:22,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83031 states. [2019-12-27 12:49:26,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83031 to 76080. [2019-12-27 12:49:26,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76080 states. [2019-12-27 12:49:26,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76080 states to 76080 states and 270629 transitions. [2019-12-27 12:49:26,649 INFO L78 Accepts]: Start accepts. Automaton has 76080 states and 270629 transitions. Word has length 70 [2019-12-27 12:49:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:26,649 INFO L462 AbstractCegarLoop]: Abstraction has 76080 states and 270629 transitions. [2019-12-27 12:49:26,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:49:26,649 INFO L276 IsEmpty]: Start isEmpty. Operand 76080 states and 270629 transitions. [2019-12-27 12:49:26,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 12:49:26,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:26,732 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] [2019-12-27 12:49:26,733 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:26,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:26,733 INFO L82 PathProgramCache]: Analyzing trace with hash -1291766390, now seen corresponding path program 1 times [2019-12-27 12:49:26,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:26,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371970191] [2019-12-27 12:49:26,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:26,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:26,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:26,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371970191] [2019-12-27 12:49:26,783 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:26,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:49:26,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907324872] [2019-12-27 12:49:26,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:49:26,784 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:26,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:49:26,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:49:26,784 INFO L87 Difference]: Start difference. First operand 76080 states and 270629 transitions. Second operand 3 states. [2019-12-27 12:49:27,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:27,068 INFO L93 Difference]: Finished difference Result 54416 states and 197410 transitions. [2019-12-27 12:49:27,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:49:27,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 12:49:27,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:27,185 INFO L225 Difference]: With dead ends: 54416 [2019-12-27 12:49:27,185 INFO L226 Difference]: Without dead ends: 54254 [2019-12-27 12:49:27,185 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:49:27,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54254 states. [2019-12-27 12:49:28,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54254 to 54214. [2019-12-27 12:49:28,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54214 states. [2019-12-27 12:49:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54214 states to 54214 states and 196825 transitions. [2019-12-27 12:49:28,623 INFO L78 Accepts]: Start accepts. Automaton has 54214 states and 196825 transitions. Word has length 70 [2019-12-27 12:49:28,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:28,624 INFO L462 AbstractCegarLoop]: Abstraction has 54214 states and 196825 transitions. [2019-12-27 12:49:28,624 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:49:28,624 INFO L276 IsEmpty]: Start isEmpty. Operand 54214 states and 196825 transitions. [2019-12-27 12:49:28,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 12:49:28,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:28,660 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] [2019-12-27 12:49:28,661 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:28,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:28,661 INFO L82 PathProgramCache]: Analyzing trace with hash -1538482368, now seen corresponding path program 1 times [2019-12-27 12:49:28,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:28,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052332748] [2019-12-27 12:49:28,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:28,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:28,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:28,750 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052332748] [2019-12-27 12:49:28,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:28,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:49:28,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374313423] [2019-12-27 12:49:28,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:49:28,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:28,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:49:28,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:49:28,753 INFO L87 Difference]: Start difference. First operand 54214 states and 196825 transitions. Second operand 5 states. [2019-12-27 12:49:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:29,526 INFO L93 Difference]: Finished difference Result 84429 states and 303657 transitions. [2019-12-27 12:49:29,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:49:29,526 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 12:49:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:29,710 INFO L225 Difference]: With dead ends: 84429 [2019-12-27 12:49:29,710 INFO L226 Difference]: Without dead ends: 84233 [2019-12-27 12:49:29,710 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:29,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84233 states. [2019-12-27 12:49:31,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84233 to 76148. [2019-12-27 12:49:31,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76148 states. [2019-12-27 12:49:31,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76148 states to 76148 states and 275545 transitions. [2019-12-27 12:49:31,822 INFO L78 Accepts]: Start accepts. Automaton has 76148 states and 275545 transitions. Word has length 71 [2019-12-27 12:49:31,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:31,822 INFO L462 AbstractCegarLoop]: Abstraction has 76148 states and 275545 transitions. [2019-12-27 12:49:31,822 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:31,822 INFO L276 IsEmpty]: Start isEmpty. Operand 76148 states and 275545 transitions. [2019-12-27 12:49:31,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-27 12:49:31,883 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:31,883 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] [2019-12-27 12:49:31,883 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:31,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:31,884 INFO L82 PathProgramCache]: Analyzing trace with hash -293717887, now seen corresponding path program 1 times [2019-12-27 12:49:31,884 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:31,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994921007] [2019-12-27 12:49:31,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:31,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:31,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:31,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994921007] [2019-12-27 12:49:31,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:31,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:49:31,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745643129] [2019-12-27 12:49:31,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:49:31,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:31,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:49:31,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:49:31,983 INFO L87 Difference]: Start difference. First operand 76148 states and 275545 transitions. Second operand 5 states. [2019-12-27 12:49:32,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:32,134 INFO L93 Difference]: Finished difference Result 19616 states and 62266 transitions. [2019-12-27 12:49:32,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:49:32,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-27 12:49:32,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:32,177 INFO L225 Difference]: With dead ends: 19616 [2019-12-27 12:49:32,177 INFO L226 Difference]: Without dead ends: 19138 [2019-12-27 12:49:32,177 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:32,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19138 states. [2019-12-27 12:49:32,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19138 to 19126. [2019-12-27 12:49:32,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19126 states. [2019-12-27 12:49:32,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19126 states to 19126 states and 60761 transitions. [2019-12-27 12:49:32,486 INFO L78 Accepts]: Start accepts. Automaton has 19126 states and 60761 transitions. Word has length 71 [2019-12-27 12:49:32,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:32,486 INFO L462 AbstractCegarLoop]: Abstraction has 19126 states and 60761 transitions. [2019-12-27 12:49:32,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:32,486 INFO L276 IsEmpty]: Start isEmpty. Operand 19126 states and 60761 transitions. [2019-12-27 12:49:32,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 12:49:32,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:32,507 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-27 12:49:32,507 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:32,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:32,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1162099754, now seen corresponding path program 1 times [2019-12-27 12:49:32,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:32,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460705308] [2019-12-27 12:49:32,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:32,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:32,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:32,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460705308] [2019-12-27 12:49:32,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:32,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:49:32,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287042268] [2019-12-27 12:49:32,561 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:49:32,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:32,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:49:32,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:49:32,562 INFO L87 Difference]: Start difference. First operand 19126 states and 60761 transitions. Second operand 4 states. [2019-12-27 12:49:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:32,926 INFO L93 Difference]: Finished difference Result 24076 states and 75429 transitions. [2019-12-27 12:49:32,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:49:32,927 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 80 [2019-12-27 12:49:32,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:32,965 INFO L225 Difference]: With dead ends: 24076 [2019-12-27 12:49:32,965 INFO L226 Difference]: Without dead ends: 24076 [2019-12-27 12:49:32,965 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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-27 12:49:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24076 states. [2019-12-27 12:49:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24076 to 19966. [2019-12-27 12:49:33,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19966 states. [2019-12-27 12:49:33,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19966 states to 19966 states and 63128 transitions. [2019-12-27 12:49:33,242 INFO L78 Accepts]: Start accepts. Automaton has 19966 states and 63128 transitions. Word has length 80 [2019-12-27 12:49:33,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:33,243 INFO L462 AbstractCegarLoop]: Abstraction has 19966 states and 63128 transitions. [2019-12-27 12:49:33,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:49:33,243 INFO L276 IsEmpty]: Start isEmpty. Operand 19966 states and 63128 transitions. [2019-12-27 12:49:33,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-27 12:49:33,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:33,258 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-27 12:49:33,258 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:33,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:33,259 INFO L82 PathProgramCache]: Analyzing trace with hash 907363209, now seen corresponding path program 1 times [2019-12-27 12:49:33,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:33,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134276855] [2019-12-27 12:49:33,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:33,346 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134276855] [2019-12-27 12:49:33,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:33,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 12:49:33,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862395579] [2019-12-27 12:49:33,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 12:49:33,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:33,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 12:49:33,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:49:33,347 INFO L87 Difference]: Start difference. First operand 19966 states and 63128 transitions. Second operand 8 states. [2019-12-27 12:49:34,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:34,289 INFO L93 Difference]: Finished difference Result 22072 states and 69320 transitions. [2019-12-27 12:49:34,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 12:49:34,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 80 [2019-12-27 12:49:34,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:34,341 INFO L225 Difference]: With dead ends: 22072 [2019-12-27 12:49:34,342 INFO L226 Difference]: Without dead ends: 22024 [2019-12-27 12:49:34,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 12:49:34,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22024 states. [2019-12-27 12:49:34,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22024 to 19438. [2019-12-27 12:49:34,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19438 states. [2019-12-27 12:49:34,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19438 states to 19438 states and 61630 transitions. [2019-12-27 12:49:34,661 INFO L78 Accepts]: Start accepts. Automaton has 19438 states and 61630 transitions. Word has length 80 [2019-12-27 12:49:34,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:34,662 INFO L462 AbstractCegarLoop]: Abstraction has 19438 states and 61630 transitions. [2019-12-27 12:49:34,662 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 12:49:34,662 INFO L276 IsEmpty]: Start isEmpty. Operand 19438 states and 61630 transitions. [2019-12-27 12:49:34,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 12:49:34,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:34,679 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] [2019-12-27 12:49:34,679 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:34,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:34,680 INFO L82 PathProgramCache]: Analyzing trace with hash -1999994915, now seen corresponding path program 1 times [2019-12-27 12:49:34,680 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:34,680 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675233647] [2019-12-27 12:49:34,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:34,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:34,772 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675233647] [2019-12-27 12:49:34,773 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:34,773 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 12:49:34,773 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234854391] [2019-12-27 12:49:34,773 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 12:49:34,773 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:34,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 12:49:34,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:49:34,774 INFO L87 Difference]: Start difference. First operand 19438 states and 61630 transitions. Second operand 8 states. [2019-12-27 12:49:37,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:37,477 INFO L93 Difference]: Finished difference Result 50432 states and 153648 transitions. [2019-12-27 12:49:37,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 12:49:37,477 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 83 [2019-12-27 12:49:37,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:37,560 INFO L225 Difference]: With dead ends: 50432 [2019-12-27 12:49:37,560 INFO L226 Difference]: Without dead ends: 49733 [2019-12-27 12:49:37,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=497, Unknown=0, NotChecked=0, Total=650 [2019-12-27 12:49:37,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49733 states. [2019-12-27 12:49:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49733 to 29966. [2019-12-27 12:49:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29966 states. [2019-12-27 12:49:38,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29966 states to 29966 states and 93560 transitions. [2019-12-27 12:49:38,268 INFO L78 Accepts]: Start accepts. Automaton has 29966 states and 93560 transitions. Word has length 83 [2019-12-27 12:49:38,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:38,268 INFO L462 AbstractCegarLoop]: Abstraction has 29966 states and 93560 transitions. [2019-12-27 12:49:38,269 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 12:49:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 29966 states and 93560 transitions. [2019-12-27 12:49:38,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 12:49:38,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:38,303 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] [2019-12-27 12:49:38,303 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:38,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:38,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1038380898, now seen corresponding path program 1 times [2019-12-27 12:49:38,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:38,304 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517132693] [2019-12-27 12:49:38,304 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:38,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:38,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517132693] [2019-12-27 12:49:38,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:38,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:49:38,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953766475] [2019-12-27 12:49:38,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:49:38,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:38,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:49:38,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:49:38,406 INFO L87 Difference]: Start difference. First operand 29966 states and 93560 transitions. Second operand 6 states. [2019-12-27 12:49:39,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:39,023 INFO L93 Difference]: Finished difference Result 31404 states and 97497 transitions. [2019-12-27 12:49:39,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:49:39,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-27 12:49:39,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:39,078 INFO L225 Difference]: With dead ends: 31404 [2019-12-27 12:49:39,078 INFO L226 Difference]: Without dead ends: 31404 [2019-12-27 12:49:39,079 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-27 12:49:39,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31404 states. [2019-12-27 12:49:39,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31404 to 29635. [2019-12-27 12:49:39,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29635 states. [2019-12-27 12:49:39,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29635 states to 29635 states and 92403 transitions. [2019-12-27 12:49:39,526 INFO L78 Accepts]: Start accepts. Automaton has 29635 states and 92403 transitions. Word has length 83 [2019-12-27 12:49:39,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:39,527 INFO L462 AbstractCegarLoop]: Abstraction has 29635 states and 92403 transitions. [2019-12-27 12:49:39,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:49:39,527 INFO L276 IsEmpty]: Start isEmpty. Operand 29635 states and 92403 transitions. [2019-12-27 12:49:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 12:49:39,556 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:39,556 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] [2019-12-27 12:49:39,556 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash 1320926111, now seen corresponding path program 1 times [2019-12-27 12:49:39,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:39,557 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554142954] [2019-12-27 12:49:39,557 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:39,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:39,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554142954] [2019-12-27 12:49:39,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:39,663 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:49:39,663 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159811516] [2019-12-27 12:49:39,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:49:39,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:39,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:49:39,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:39,668 INFO L87 Difference]: Start difference. First operand 29635 states and 92403 transitions. Second operand 7 states. [2019-12-27 12:49:40,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:40,250 INFO L93 Difference]: Finished difference Result 31149 states and 96559 transitions. [2019-12-27 12:49:40,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 12:49:40,251 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-27 12:49:40,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:40,299 INFO L225 Difference]: With dead ends: 31149 [2019-12-27 12:49:40,299 INFO L226 Difference]: Without dead ends: 31149 [2019-12-27 12:49:40,300 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-27 12:49:40,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31149 states. [2019-12-27 12:49:40,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31149 to 29967. [2019-12-27 12:49:40,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29967 states. [2019-12-27 12:49:40,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29967 states to 29967 states and 93234 transitions. [2019-12-27 12:49:40,907 INFO L78 Accepts]: Start accepts. Automaton has 29967 states and 93234 transitions. Word has length 83 [2019-12-27 12:49:40,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:40,908 INFO L462 AbstractCegarLoop]: Abstraction has 29967 states and 93234 transitions. [2019-12-27 12:49:40,908 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:49:40,908 INFO L276 IsEmpty]: Start isEmpty. Operand 29967 states and 93234 transitions. [2019-12-27 12:49:40,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-27 12:49:40,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:40,938 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] [2019-12-27 12:49:40,938 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:40,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:40,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1650691872, now seen corresponding path program 1 times [2019-12-27 12:49:40,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:40,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52075388] [2019-12-27 12:49:40,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:40,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:41,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:41,015 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52075388] [2019-12-27 12:49:41,015 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:41,015 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:49:41,015 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320148926] [2019-12-27 12:49:41,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:49:41,016 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:41,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:49:41,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:49:41,017 INFO L87 Difference]: Start difference. First operand 29967 states and 93234 transitions. Second operand 5 states. [2019-12-27 12:49:41,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:41,065 INFO L93 Difference]: Finished difference Result 4530 states and 11170 transitions. [2019-12-27 12:49:41,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 12:49:41,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2019-12-27 12:49:41,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:41,071 INFO L225 Difference]: With dead ends: 4530 [2019-12-27 12:49:41,071 INFO L226 Difference]: Without dead ends: 3740 [2019-12-27 12:49:41,071 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-27 12:49:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3740 states. [2019-12-27 12:49:41,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3740 to 3437. [2019-12-27 12:49:41,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3437 states. [2019-12-27 12:49:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3437 states to 3437 states and 8371 transitions. [2019-12-27 12:49:41,119 INFO L78 Accepts]: Start accepts. Automaton has 3437 states and 8371 transitions. Word has length 83 [2019-12-27 12:49:41,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:41,120 INFO L462 AbstractCegarLoop]: Abstraction has 3437 states and 8371 transitions. [2019-12-27 12:49:41,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 3437 states and 8371 transitions. [2019-12-27 12:49:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:41,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:41,124 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, 1] [2019-12-27 12:49:41,124 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:41,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash -843880616, now seen corresponding path program 1 times [2019-12-27 12:49:41,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:41,125 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034382125] [2019-12-27 12:49:41,125 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:41,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:41,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034382125] [2019-12-27 12:49:41,216 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:41,216 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:49:41,216 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231070153] [2019-12-27 12:49:41,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:49:41,217 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:41,217 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:49:41,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:49:41,218 INFO L87 Difference]: Start difference. First operand 3437 states and 8371 transitions. Second operand 6 states. [2019-12-27 12:49:41,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:41,634 INFO L93 Difference]: Finished difference Result 3716 states and 8919 transitions. [2019-12-27 12:49:41,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:49:41,634 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 12:49:41,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:41,639 INFO L225 Difference]: With dead ends: 3716 [2019-12-27 12:49:41,640 INFO L226 Difference]: Without dead ends: 3670 [2019-12-27 12:49:41,640 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-27 12:49:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2019-12-27 12:49:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3580. [2019-12-27 12:49:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-12-27 12:49:41,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 8658 transitions. [2019-12-27 12:49:41,706 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 8658 transitions. Word has length 95 [2019-12-27 12:49:41,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:41,706 INFO L462 AbstractCegarLoop]: Abstraction has 3580 states and 8658 transitions. [2019-12-27 12:49:41,706 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:49:41,707 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 8658 transitions. [2019-12-27 12:49:41,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:41,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:41,713 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, 1] [2019-12-27 12:49:41,713 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:41,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:41,714 INFO L82 PathProgramCache]: Analyzing trace with hash 285188987, now seen corresponding path program 1 times [2019-12-27 12:49:41,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:41,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027188852] [2019-12-27 12:49:41,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:41,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027188852] [2019-12-27 12:49:41,853 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:41,853 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:49:41,853 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201999271] [2019-12-27 12:49:41,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:49:41,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:41,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:49:41,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:49:41,855 INFO L87 Difference]: Start difference. First operand 3580 states and 8658 transitions. Second operand 5 states. [2019-12-27 12:49:42,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:42,091 INFO L93 Difference]: Finished difference Result 4418 states and 10489 transitions. [2019-12-27 12:49:42,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 12:49:42,091 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 12:49:42,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:42,097 INFO L225 Difference]: With dead ends: 4418 [2019-12-27 12:49:42,097 INFO L226 Difference]: Without dead ends: 4377 [2019-12-27 12:49:42,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 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-27 12:49:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4377 states. [2019-12-27 12:49:42,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4377 to 3845. [2019-12-27 12:49:42,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3845 states. [2019-12-27 12:49:42,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 9231 transitions. [2019-12-27 12:49:42,153 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 9231 transitions. Word has length 95 [2019-12-27 12:49:42,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:42,153 INFO L462 AbstractCegarLoop]: Abstraction has 3845 states and 9231 transitions. [2019-12-27 12:49:42,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:42,153 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 9231 transitions. [2019-12-27 12:49:42,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:42,159 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:42,159 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, 1] [2019-12-27 12:49:42,159 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:42,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:42,160 INFO L82 PathProgramCache]: Analyzing trace with hash -637494596, now seen corresponding path program 1 times [2019-12-27 12:49:42,160 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:42,160 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447574932] [2019-12-27 12:49:42,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:42,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:42,250 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447574932] [2019-12-27 12:49:42,250 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:42,250 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 12:49:42,251 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [781162943] [2019-12-27 12:49:42,251 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 12:49:42,251 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:42,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 12:49:42,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:42,252 INFO L87 Difference]: Start difference. First operand 3845 states and 9231 transitions. Second operand 7 states. [2019-12-27 12:49:42,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:42,916 INFO L93 Difference]: Finished difference Result 6165 states and 14551 transitions. [2019-12-27 12:49:42,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 12:49:42,917 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-27 12:49:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:42,924 INFO L225 Difference]: With dead ends: 6165 [2019-12-27 12:49:42,924 INFO L226 Difference]: Without dead ends: 6064 [2019-12-27 12:49:42,925 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-27 12:49:42,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6064 states. [2019-12-27 12:49:42,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6064 to 4059. [2019-12-27 12:49:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4059 states. [2019-12-27 12:49:42,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4059 states to 4059 states and 9687 transitions. [2019-12-27 12:49:42,969 INFO L78 Accepts]: Start accepts. Automaton has 4059 states and 9687 transitions. Word has length 95 [2019-12-27 12:49:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:42,969 INFO L462 AbstractCegarLoop]: Abstraction has 4059 states and 9687 transitions. [2019-12-27 12:49:42,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 12:49:42,969 INFO L276 IsEmpty]: Start isEmpty. Operand 4059 states and 9687 transitions. [2019-12-27 12:49:42,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:42,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:42,973 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, 1] [2019-12-27 12:49:42,973 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:42,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:42,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1721812413, now seen corresponding path program 1 times [2019-12-27 12:49:42,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:42,974 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066118588] [2019-12-27 12:49:42,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:43,078 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066118588] [2019-12-27 12:49:43,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:43,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:49:43,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471099439] [2019-12-27 12:49:43,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:49:43,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:43,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:49:43,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:49:43,080 INFO L87 Difference]: Start difference. First operand 4059 states and 9687 transitions. Second operand 6 states. [2019-12-27 12:49:43,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:43,253 INFO L93 Difference]: Finished difference Result 4800 states and 11049 transitions. [2019-12-27 12:49:43,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:49:43,253 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 12:49:43,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:43,259 INFO L225 Difference]: With dead ends: 4800 [2019-12-27 12:49:43,259 INFO L226 Difference]: Without dead ends: 4759 [2019-12-27 12:49:43,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 12:49:43,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4759 states. [2019-12-27 12:49:43,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4759 to 4171. [2019-12-27 12:49:43,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4171 states. [2019-12-27 12:49:43,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4171 states to 4171 states and 9813 transitions. [2019-12-27 12:49:43,317 INFO L78 Accepts]: Start accepts. Automaton has 4171 states and 9813 transitions. Word has length 95 [2019-12-27 12:49:43,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:43,317 INFO L462 AbstractCegarLoop]: Abstraction has 4171 states and 9813 transitions. [2019-12-27 12:49:43,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:49:43,317 INFO L276 IsEmpty]: Start isEmpty. Operand 4171 states and 9813 transitions. [2019-12-27 12:49:43,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:43,323 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:43,323 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, 1] [2019-12-27 12:49:43,323 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:43,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:43,324 INFO L82 PathProgramCache]: Analyzing trace with hash 2051578174, now seen corresponding path program 1 times [2019-12-27 12:49:43,324 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:43,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567453809] [2019-12-27 12:49:43,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:43,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:43,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:43,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567453809] [2019-12-27 12:49:43,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:43,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 12:49:43,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254237558] [2019-12-27 12:49:43,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 12:49:43,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:43,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 12:49:43,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 12:49:43,404 INFO L87 Difference]: Start difference. First operand 4171 states and 9813 transitions. Second operand 6 states. [2019-12-27 12:49:43,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:43,706 INFO L93 Difference]: Finished difference Result 4507 states and 10513 transitions. [2019-12-27 12:49:43,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 12:49:43,707 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-27 12:49:43,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:43,715 INFO L225 Difference]: With dead ends: 4507 [2019-12-27 12:49:43,715 INFO L226 Difference]: Without dead ends: 4507 [2019-12-27 12:49:43,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-27 12:49:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4507 states. [2019-12-27 12:49:43,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4507 to 3873. [2019-12-27 12:49:43,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2019-12-27 12:49:43,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 9117 transitions. [2019-12-27 12:49:43,791 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 9117 transitions. Word has length 95 [2019-12-27 12:49:43,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:43,792 INFO L462 AbstractCegarLoop]: Abstraction has 3873 states and 9117 transitions. [2019-12-27 12:49:43,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 12:49:43,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 9117 transitions. [2019-12-27 12:49:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:43,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:43,798 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, 1] [2019-12-27 12:49:43,798 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 41474333, now seen corresponding path program 1 times [2019-12-27 12:49:43,801 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:43,801 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629252801] [2019-12-27 12:49:43,801 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:43,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:43,918 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629252801] [2019-12-27 12:49:43,919 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:43,919 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 12:49:43,919 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125634865] [2019-12-27 12:49:43,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 12:49:43,920 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:43,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 12:49:43,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 12:49:43,920 INFO L87 Difference]: Start difference. First operand 3873 states and 9117 transitions. Second operand 4 states. [2019-12-27 12:49:44,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:44,119 INFO L93 Difference]: Finished difference Result 4179 states and 9813 transitions. [2019-12-27 12:49:44,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:49:44,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-27 12:49:44,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:44,124 INFO L225 Difference]: With dead ends: 4179 [2019-12-27 12:49:44,125 INFO L226 Difference]: Without dead ends: 4143 [2019-12-27 12:49:44,125 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-27 12:49:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4143 states. [2019-12-27 12:49:44,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4143 to 3873. [2019-12-27 12:49:44,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3873 states. [2019-12-27 12:49:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3873 states to 3873 states and 9099 transitions. [2019-12-27 12:49:44,169 INFO L78 Accepts]: Start accepts. Automaton has 3873 states and 9099 transitions. Word has length 95 [2019-12-27 12:49:44,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:44,169 INFO L462 AbstractCegarLoop]: Abstraction has 3873 states and 9099 transitions. [2019-12-27 12:49:44,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 12:49:44,169 INFO L276 IsEmpty]: Start isEmpty. Operand 3873 states and 9099 transitions. [2019-12-27 12:49:44,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:44,172 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:44,172 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, 1] [2019-12-27 12:49:44,172 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:44,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:44,173 INFO L82 PathProgramCache]: Analyzing trace with hash -241676131, now seen corresponding path program 1 times [2019-12-27 12:49:44,173 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:44,173 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465907392] [2019-12-27 12:49:44,173 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:44,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:44,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:44,246 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465907392] [2019-12-27 12:49:44,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:44,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:49:44,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896514795] [2019-12-27 12:49:44,247 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:49:44,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:44,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:49:44,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:49:44,247 INFO L87 Difference]: Start difference. First operand 3873 states and 9099 transitions. Second operand 5 states. [2019-12-27 12:49:44,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:44,443 INFO L93 Difference]: Finished difference Result 3693 states and 8535 transitions. [2019-12-27 12:49:44,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 12:49:44,444 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-27 12:49:44,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:44,450 INFO L225 Difference]: With dead ends: 3693 [2019-12-27 12:49:44,450 INFO L226 Difference]: Without dead ends: 3675 [2019-12-27 12:49:44,450 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-27 12:49:44,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3675 states. [2019-12-27 12:49:44,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3675 to 2644. [2019-12-27 12:49:44,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2644 states. [2019-12-27 12:49:44,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2644 states to 2644 states and 6157 transitions. [2019-12-27 12:49:44,508 INFO L78 Accepts]: Start accepts. Automaton has 2644 states and 6157 transitions. Word has length 95 [2019-12-27 12:49:44,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:44,508 INFO L462 AbstractCegarLoop]: Abstraction has 2644 states and 6157 transitions. [2019-12-27 12:49:44,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:44,509 INFO L276 IsEmpty]: Start isEmpty. Operand 2644 states and 6157 transitions. [2019-12-27 12:49:44,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-27 12:49:44,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:44,514 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, 1] [2019-12-27 12:49:44,514 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:44,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:44,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1003088350, now seen corresponding path program 1 times [2019-12-27 12:49:44,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:44,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438345694] [2019-12-27 12:49:44,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:44,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:44,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438345694] [2019-12-27 12:49:44,581 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:44,581 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 12:49:44,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849917186] [2019-12-27 12:49:44,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 12:49:44,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:44,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 12:49:44,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:49:44,583 INFO L87 Difference]: Start difference. First operand 2644 states and 6157 transitions. Second operand 3 states. [2019-12-27 12:49:44,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:44,616 INFO L93 Difference]: Finished difference Result 2379 states and 5522 transitions. [2019-12-27 12:49:44,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 12:49:44,616 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-27 12:49:44,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:44,621 INFO L225 Difference]: With dead ends: 2379 [2019-12-27 12:49:44,621 INFO L226 Difference]: Without dead ends: 2361 [2019-12-27 12:49:44,621 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 12:49:44,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2361 states. [2019-12-27 12:49:44,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2361 to 2261. [2019-12-27 12:49:44,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2261 states. [2019-12-27 12:49:44,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2261 states to 2261 states and 5287 transitions. [2019-12-27 12:49:44,664 INFO L78 Accepts]: Start accepts. Automaton has 2261 states and 5287 transitions. Word has length 95 [2019-12-27 12:49:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:44,665 INFO L462 AbstractCegarLoop]: Abstraction has 2261 states and 5287 transitions. [2019-12-27 12:49:44,665 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 12:49:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 2261 states and 5287 transitions. [2019-12-27 12:49:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:49:44,668 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:44,669 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, 1, 1, 1] [2019-12-27 12:49:44,669 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:44,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:44,670 INFO L82 PathProgramCache]: Analyzing trace with hash 756751223, now seen corresponding path program 1 times [2019-12-27 12:49:44,670 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:44,671 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481458695] [2019-12-27 12:49:44,671 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:44,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:44,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:44,786 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481458695] [2019-12-27 12:49:44,786 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:44,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:49:44,787 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669950660] [2019-12-27 12:49:44,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:49:44,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:44,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:49:44,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:49:44,788 INFO L87 Difference]: Start difference. First operand 2261 states and 5287 transitions. Second operand 5 states. [2019-12-27 12:49:44,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:44,932 INFO L93 Difference]: Finished difference Result 2206 states and 5152 transitions. [2019-12-27 12:49:44,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:49:44,933 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-27 12:49:44,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:44,937 INFO L225 Difference]: With dead ends: 2206 [2019-12-27 12:49:44,937 INFO L226 Difference]: Without dead ends: 2206 [2019-12-27 12:49:44,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 12:49:44,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2206 states. [2019-12-27 12:49:44,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2206 to 2184. [2019-12-27 12:49:44,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2184 states. [2019-12-27 12:49:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 5106 transitions. [2019-12-27 12:49:44,978 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 5106 transitions. Word has length 97 [2019-12-27 12:49:44,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:44,978 INFO L462 AbstractCegarLoop]: Abstraction has 2184 states and 5106 transitions. [2019-12-27 12:49:44,979 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:44,979 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 5106 transitions. [2019-12-27 12:49:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:49:44,982 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:44,982 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, 1, 1, 1] [2019-12-27 12:49:44,983 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:44,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:44,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1696531523, now seen corresponding path program 1 times [2019-12-27 12:49:44,984 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:44,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461972485] [2019-12-27 12:49:44,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:45,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:45,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:45,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461972485] [2019-12-27 12:49:45,078 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:45,078 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 12:49:45,079 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717638549] [2019-12-27 12:49:45,079 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 12:49:45,079 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:45,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 12:49:45,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 12:49:45,080 INFO L87 Difference]: Start difference. First operand 2184 states and 5106 transitions. Second operand 5 states. [2019-12-27 12:49:45,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:45,118 INFO L93 Difference]: Finished difference Result 3125 states and 7441 transitions. [2019-12-27 12:49:45,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 12:49:45,119 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 97 [2019-12-27 12:49:45,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:45,123 INFO L225 Difference]: With dead ends: 3125 [2019-12-27 12:49:45,123 INFO L226 Difference]: Without dead ends: 3125 [2019-12-27 12:49:45,125 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-27 12:49:45,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3125 states. [2019-12-27 12:49:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3125 to 2146. [2019-12-27 12:49:45,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2146 states. [2019-12-27 12:49:45,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2146 states to 2146 states and 4970 transitions. [2019-12-27 12:49:45,158 INFO L78 Accepts]: Start accepts. Automaton has 2146 states and 4970 transitions. Word has length 97 [2019-12-27 12:49:45,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:45,159 INFO L462 AbstractCegarLoop]: Abstraction has 2146 states and 4970 transitions. [2019-12-27 12:49:45,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 12:49:45,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2146 states and 4970 transitions. [2019-12-27 12:49:45,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:49:45,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:45,161 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, 1, 1, 1] [2019-12-27 12:49:45,162 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:45,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:45,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1415088476, now seen corresponding path program 1 times [2019-12-27 12:49:45,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:45,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694349944] [2019-12-27 12:49:45,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:45,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 12:49:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 12:49:45,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694349944] [2019-12-27 12:49:45,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 12:49:45,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 12:49:45,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734648878] [2019-12-27 12:49:45,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 12:49:45,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 12:49:45,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 12:49:45,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 12:49:45,279 INFO L87 Difference]: Start difference. First operand 2146 states and 4970 transitions. Second operand 8 states. [2019-12-27 12:49:45,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 12:49:45,399 INFO L93 Difference]: Finished difference Result 3515 states and 8250 transitions. [2019-12-27 12:49:45,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 12:49:45,400 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-12-27 12:49:45,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 12:49:45,402 INFO L225 Difference]: With dead ends: 3515 [2019-12-27 12:49:45,402 INFO L226 Difference]: Without dead ends: 1453 [2019-12-27 12:49:45,406 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-27 12:49:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1453 states. [2019-12-27 12:49:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1453 to 1365. [2019-12-27 12:49:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2019-12-27 12:49:45,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 3237 transitions. [2019-12-27 12:49:45,432 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 3237 transitions. Word has length 97 [2019-12-27 12:49:45,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 12:49:45,432 INFO L462 AbstractCegarLoop]: Abstraction has 1365 states and 3237 transitions. [2019-12-27 12:49:45,432 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 12:49:45,433 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 3237 transitions. [2019-12-27 12:49:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 12:49:45,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 12:49:45,435 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, 1, 1, 1] [2019-12-27 12:49:45,436 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 12:49:45,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 12:49:45,436 INFO L82 PathProgramCache]: Analyzing trace with hash -466492236, now seen corresponding path program 2 times [2019-12-27 12:49:45,437 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 12:49:45,437 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692519357] [2019-12-27 12:49:45,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 12:49:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:49:45,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 12:49:45,608 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 12:49:45,609 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 12:49:45,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 12:49:45 BasicIcfg [2019-12-27 12:49:45,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 12:49:45,829 INFO L168 Benchmark]: Toolchain (without parser) took 57431.82 ms. Allocated memory was 137.9 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 100.7 MB in the beginning and 567.3 MB in the end (delta: -466.6 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 12:49:45,830 INFO L168 Benchmark]: CDTParser took 0.74 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 12:49:45,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.32 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 155.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 12:49:45,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.50 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 12:49:45,831 INFO L168 Benchmark]: Boogie Preprocessor took 38.19 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 12:49:45,832 INFO L168 Benchmark]: RCFGBuilder took 747.42 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 105.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 12:49:45,832 INFO L168 Benchmark]: TraceAbstraction took 55777.90 ms. Allocated memory was 201.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 105.1 MB in the beginning and 567.3 MB in the end (delta: -462.2 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-27 12:49:45,834 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.74 ms. Allocated memory is still 137.9 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.32 ms. Allocated memory was 137.9 MB in the beginning and 201.3 MB in the end (delta: 63.4 MB). Free memory was 100.3 MB in the beginning and 155.4 MB in the end (delta: -55.1 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 78.50 ms. Allocated memory is still 201.3 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.19 ms. Allocated memory is still 201.3 MB. Free memory was 152.7 MB in the beginning and 150.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 747.42 ms. Allocated memory is still 201.3 MB. Free memory was 150.1 MB in the beginning and 105.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 55777.90 ms. Allocated memory was 201.3 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 105.1 MB in the beginning and 567.3 MB in the end (delta: -462.2 MB). Peak memory consumption was 2.1 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] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L704] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L708] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L709] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L710] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L711] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L712] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L714] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L716] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L718] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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] [L720] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L721] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L722] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L788] 0 pthread_t t1607; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=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, z=0] [L789] FCALL, FORK 0 pthread_create(&t1607, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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, z=0] [L790] 0 pthread_t t1608; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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, z=0] [L791] FCALL, FORK 0 pthread_create(&t1608, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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, z=0] [L746] 2 y$w_buff1 = y$w_buff0 [L747] 2 y$w_buff0 = 2 [L748] 2 y$w_buff1_used = y$w_buff0_used [L749] 2 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0: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, z=0] [L751] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L752] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L753] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L754] 2 y$r_buff0_thd2 = (_Bool)1 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0: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=1, 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, z=1] [L726] 1 x = 1 [L729] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L732] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L732] EXPR 1 y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=1, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=1, z=1] [L732] 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) [L733] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L733] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L766] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L734] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L734] 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 [L735] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L735] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L736] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L736] 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 [L739] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L766] 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) [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L767] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L768] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L768] 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 [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L769] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L770] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L770] 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 [L773] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L793] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L797] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L797] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L797] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L797] 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) [L798] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L798] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L799] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L799] 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 [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L800] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L801] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L801] 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 [L804] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L805] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L806] 0 y$flush_delayed = weak$$choice2 [L807] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L808] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L808] 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) [L809] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L809] 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)) [L810] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L810] 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)) [L811] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L811] 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)) [L812] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L812] 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)) [L813] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L813] 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)) [L814] 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, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L814] 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)) [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L816] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L816] 0 y = y$flush_delayed ? y$mem_tmp : y [L817] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 55.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7846 SDtfs, 8697 SDslu, 19225 SDs, 0 SdLazy, 9191 SolverSat, 615 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 10.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 346 GetRequests, 86 SyntacticMatches, 25 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76148occurred 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: 26.1s AutomataMinimizationTime, 30 MinimizatonAttempts, 110525 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 2310 ConstructedInterpolants, 0 QuantifiedInterpolants, 442092 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...