/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/safe010_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 04:33:11,031 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 04:33:11,034 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 04:33:11,051 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 04:33:11,051 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 04:33:11,053 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 04:33:11,055 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 04:33:11,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 04:33:11,068 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 04:33:11,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 04:33:11,075 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 04:33:11,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 04:33:11,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 04:33:11,077 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 04:33:11,080 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 04:33:11,081 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 04:33:11,083 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 04:33:11,084 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 04:33:11,086 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 04:33:11,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 04:33:11,096 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 04:33:11,099 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 04:33:11,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 04:33:11,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 04:33:11,103 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 04:33:11,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 04:33:11,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 04:33:11,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 04:33:11,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 04:33:11,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 04:33:11,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 04:33:11,109 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 04:33:11,109 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 04:33:11,110 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 04:33:11,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 04:33:11,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 04:33:11,112 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 04:33:11,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 04:33:11,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 04:33:11,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 04:33:11,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 04:33:11,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 04:33:11,148 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 04:33:11,149 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 04:33:11,150 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 04:33:11,150 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 04:33:11,150 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 04:33:11,151 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 04:33:11,151 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 04:33:11,151 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 04:33:11,151 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 04:33:11,151 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 04:33:11,151 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 04:33:11,152 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 04:33:11,152 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 04:33:11,152 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 04:33:11,152 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 04:33:11,152 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 04:33:11,153 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 04:33:11,153 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 04:33:11,153 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 04:33:11,153 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 04:33:11,153 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 04:33:11,153 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:33:11,154 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 04:33:11,154 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 04:33:11,154 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 04:33:11,154 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 04:33:11,155 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 04:33:11,155 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 04:33:11,155 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 04:33:11,155 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 04:33:11,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 04:33:11,434 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 04:33:11,436 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 04:33:11,438 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 04:33:11,438 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 04:33:11,439 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-19 04:33:11,497 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5f84ad0/6a96141ebea14eb8a8d0f4cee3ebac67/FLAGc47ad5537 [2019-12-19 04:33:12,064 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 04:33:12,065 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe010_pso.oepc.i [2019-12-19 04:33:12,087 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5f84ad0/6a96141ebea14eb8a8d0f4cee3ebac67/FLAGc47ad5537 [2019-12-19 04:33:12,323 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d5f84ad0/6a96141ebea14eb8a8d0f4cee3ebac67 [2019-12-19 04:33:12,331 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 04:33:12,332 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 04:33:12,333 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 04:33:12,334 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 04:33:12,337 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 04:33:12,338 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:33:12" (1/1) ... [2019-12-19 04:33:12,341 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@745d7f31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:12, skipping insertion in model container [2019-12-19 04:33:12,341 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 04:33:12" (1/1) ... [2019-12-19 04:33:12,348 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 04:33:12,388 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 04:33:12,873 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:33:12,891 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 04:33:12,948 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 04:33:13,034 INFO L208 MainTranslator]: Completed translation [2019-12-19 04:33:13,034 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13 WrapperNode [2019-12-19 04:33:13,034 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 04:33:13,035 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 04:33:13,035 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 04:33:13,035 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 04:33:13,044 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,063 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,110 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 04:33:13,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 04:33:13,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 04:33:13,117 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 04:33:13,124 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,125 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,129 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,130 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,143 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,146 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... [2019-12-19 04:33:13,151 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 04:33:13,151 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 04:33:13,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 04:33:13,151 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 04:33:13,152 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 04:33:13,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 04:33:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 04:33:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 04:33:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 04:33:13,223 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 04:33:13,223 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 04:33:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 04:33:13,224 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 04:33:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 04:33:13,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 04:33:13,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 04:33:13,226 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 04:33:13,962 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 04:33:13,963 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 04:33:13,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:33:13 BoogieIcfgContainer [2019-12-19 04:33:13,964 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 04:33:13,966 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 04:33:13,966 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 04:33:13,969 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 04:33:13,970 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 04:33:12" (1/3) ... [2019-12-19 04:33:13,971 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d89fd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:33:13, skipping insertion in model container [2019-12-19 04:33:13,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 04:33:13" (2/3) ... [2019-12-19 04:33:13,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d89fd6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 04:33:13, skipping insertion in model container [2019-12-19 04:33:13,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 04:33:13" (3/3) ... [2019-12-19 04:33:13,974 INFO L109 eAbstractionObserver]: Analyzing ICFG safe010_pso.oepc.i [2019-12-19 04:33:13,985 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 04:33:13,985 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 04:33:13,994 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 04:33:13,995 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 04:33:14,035 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,036 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,036 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,036 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,037 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,037 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,037 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,039 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,040 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,041 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,042 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,043 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,044 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,045 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,046 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,047 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,048 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,048 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,049 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,050 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,054 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,055 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,056 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,057 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,058 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,059 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,060 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,061 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,067 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,068 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,069 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,070 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,070 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,074 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,075 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,075 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,076 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,077 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,078 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 04:33:14,094 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 04:33:14,129 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 04:33:14,129 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 04:33:14,130 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 04:33:14,130 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 04:33:14,130 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 04:33:14,130 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 04:33:14,130 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 04:33:14,130 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 04:33:14,145 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 04:33:15,518 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22510 states. [2019-12-19 04:33:15,520 INFO L276 IsEmpty]: Start isEmpty. Operand 22510 states. [2019-12-19 04:33:15,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-19 04:33:15,528 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:15,529 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] [2019-12-19 04:33:15,529 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:15,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:15,534 INFO L82 PathProgramCache]: Analyzing trace with hash 772326421, now seen corresponding path program 1 times [2019-12-19 04:33:15,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:15,543 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856044644] [2019-12-19 04:33:15,543 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:15,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:15,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:15,854 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856044644] [2019-12-19 04:33:15,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:15,855 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:15,857 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578399874] [2019-12-19 04:33:15,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:15,863 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:15,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:15,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:15,883 INFO L87 Difference]: Start difference. First operand 22510 states. Second operand 4 states. [2019-12-19 04:33:16,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:16,578 INFO L93 Difference]: Finished difference Result 23454 states and 91771 transitions. [2019-12-19 04:33:16,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:33:16,580 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-19 04:33:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:16,784 INFO L225 Difference]: With dead ends: 23454 [2019-12-19 04:33:16,785 INFO L226 Difference]: Without dead ends: 21278 [2019-12-19 04:33:16,786 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-12-19 04:33:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 21278. [2019-12-19 04:33:18,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21278 states. [2019-12-19 04:33:18,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21278 states to 21278 states and 83795 transitions. [2019-12-19 04:33:18,612 INFO L78 Accepts]: Start accepts. Automaton has 21278 states and 83795 transitions. Word has length 33 [2019-12-19 04:33:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:18,613 INFO L462 AbstractCegarLoop]: Abstraction has 21278 states and 83795 transitions. [2019-12-19 04:33:18,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 21278 states and 83795 transitions. [2019-12-19 04:33:18,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-19 04:33:18,626 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:18,626 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:18,627 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:18,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:18,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2041424114, now seen corresponding path program 1 times [2019-12-19 04:33:18,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:18,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749826830] [2019-12-19 04:33:18,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:18,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:18,793 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:18,793 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749826830] [2019-12-19 04:33:18,793 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:18,794 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:18,794 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426365377] [2019-12-19 04:33:18,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:18,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:18,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:18,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:18,797 INFO L87 Difference]: Start difference. First operand 21278 states and 83795 transitions. Second operand 5 states. [2019-12-19 04:33:19,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:19,748 INFO L93 Difference]: Finished difference Result 34712 states and 129091 transitions. [2019-12-19 04:33:19,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:19,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-19 04:33:19,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:19,934 INFO L225 Difference]: With dead ends: 34712 [2019-12-19 04:33:19,935 INFO L226 Difference]: Without dead ends: 34568 [2019-12-19 04:33:19,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:21,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34568 states. [2019-12-19 04:33:22,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34568 to 33068. [2019-12-19 04:33:22,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33068 states. [2019-12-19 04:33:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33068 states to 33068 states and 123979 transitions. [2019-12-19 04:33:22,408 INFO L78 Accepts]: Start accepts. Automaton has 33068 states and 123979 transitions. Word has length 44 [2019-12-19 04:33:22,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:22,412 INFO L462 AbstractCegarLoop]: Abstraction has 33068 states and 123979 transitions. [2019-12-19 04:33:22,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 33068 states and 123979 transitions. [2019-12-19 04:33:22,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 04:33:22,423 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:22,423 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] [2019-12-19 04:33:22,423 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:22,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:22,424 INFO L82 PathProgramCache]: Analyzing trace with hash 865833508, now seen corresponding path program 1 times [2019-12-19 04:33:22,424 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:22,424 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091800024] [2019-12-19 04:33:22,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:22,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:22,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:22,557 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091800024] [2019-12-19 04:33:22,557 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:22,557 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:22,558 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459450579] [2019-12-19 04:33:22,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:22,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:22,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:22,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:22,559 INFO L87 Difference]: Start difference. First operand 33068 states and 123979 transitions. Second operand 5 states. [2019-12-19 04:33:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:23,124 INFO L93 Difference]: Finished difference Result 40220 states and 148648 transitions. [2019-12-19 04:33:23,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:23,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 04:33:23,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:23,581 INFO L225 Difference]: With dead ends: 40220 [2019-12-19 04:33:23,581 INFO L226 Difference]: Without dead ends: 40060 [2019-12-19 04:33:23,582 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:23,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40060 states. [2019-12-19 04:33:25,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40060 to 34641. [2019-12-19 04:33:25,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34641 states. [2019-12-19 04:33:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34641 states to 34641 states and 129275 transitions. [2019-12-19 04:33:25,953 INFO L78 Accepts]: Start accepts. Automaton has 34641 states and 129275 transitions. Word has length 45 [2019-12-19 04:33:25,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:25,953 INFO L462 AbstractCegarLoop]: Abstraction has 34641 states and 129275 transitions. [2019-12-19 04:33:25,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:33:25,953 INFO L276 IsEmpty]: Start isEmpty. Operand 34641 states and 129275 transitions. [2019-12-19 04:33:25,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 04:33:25,966 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:25,966 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] [2019-12-19 04:33:25,966 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:25,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:25,967 INFO L82 PathProgramCache]: Analyzing trace with hash -566493931, now seen corresponding path program 1 times [2019-12-19 04:33:25,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:25,967 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630775301] [2019-12-19 04:33:25,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:26,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:26,063 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630775301] [2019-12-19 04:33:26,063 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:26,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:26,064 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980870484] [2019-12-19 04:33:26,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:26,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:26,065 INFO L87 Difference]: Start difference. First operand 34641 states and 129275 transitions. Second operand 6 states. [2019-12-19 04:33:27,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:27,249 INFO L93 Difference]: Finished difference Result 45669 states and 166169 transitions. [2019-12-19 04:33:27,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:33:27,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 04:33:27,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:27,386 INFO L225 Difference]: With dead ends: 45669 [2019-12-19 04:33:27,386 INFO L226 Difference]: Without dead ends: 45525 [2019-12-19 04:33:27,387 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:33:27,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45525 states. [2019-12-19 04:33:29,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45525 to 33604. [2019-12-19 04:33:29,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33604 states. [2019-12-19 04:33:29,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33604 states to 33604 states and 125430 transitions. [2019-12-19 04:33:29,641 INFO L78 Accepts]: Start accepts. Automaton has 33604 states and 125430 transitions. Word has length 52 [2019-12-19 04:33:29,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:29,642 INFO L462 AbstractCegarLoop]: Abstraction has 33604 states and 125430 transitions. [2019-12-19 04:33:29,642 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:29,642 INFO L276 IsEmpty]: Start isEmpty. Operand 33604 states and 125430 transitions. [2019-12-19 04:33:29,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-19 04:33:29,675 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:29,675 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:29,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:29,676 INFO L82 PathProgramCache]: Analyzing trace with hash -885098341, now seen corresponding path program 1 times [2019-12-19 04:33:29,676 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:29,676 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2306477] [2019-12-19 04:33:29,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:29,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:29,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:29,809 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2306477] [2019-12-19 04:33:29,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:29,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:29,810 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320095810] [2019-12-19 04:33:29,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:29,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:29,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:29,811 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:29,812 INFO L87 Difference]: Start difference. First operand 33604 states and 125430 transitions. Second operand 6 states. [2019-12-19 04:33:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:30,512 INFO L93 Difference]: Finished difference Result 46076 states and 167863 transitions. [2019-12-19 04:33:30,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:33:30,513 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-19 04:33:30,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:30,908 INFO L225 Difference]: With dead ends: 46076 [2019-12-19 04:33:30,908 INFO L226 Difference]: Without dead ends: 45836 [2019-12-19 04:33:30,909 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:33:31,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45836 states. [2019-12-19 04:33:31,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45836 to 39965. [2019-12-19 04:33:31,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39965 states. [2019-12-19 04:33:33,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39965 states to 39965 states and 147354 transitions. [2019-12-19 04:33:33,476 INFO L78 Accepts]: Start accepts. Automaton has 39965 states and 147354 transitions. Word has length 59 [2019-12-19 04:33:33,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:33,476 INFO L462 AbstractCegarLoop]: Abstraction has 39965 states and 147354 transitions. [2019-12-19 04:33:33,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:33,477 INFO L276 IsEmpty]: Start isEmpty. Operand 39965 states and 147354 transitions. [2019-12-19 04:33:33,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-12-19 04:33:33,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:33,511 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-19 04:33:33,511 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:33,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:33,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1504066544, now seen corresponding path program 1 times [2019-12-19 04:33:33,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:33,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126401683] [2019-12-19 04:33:33,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:33,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:33,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126401683] [2019-12-19 04:33:33,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:33,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:33:33,591 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173567654] [2019-12-19 04:33:33,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:33:33,593 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:33,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:33:33,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:33,594 INFO L87 Difference]: Start difference. First operand 39965 states and 147354 transitions. Second operand 3 states. [2019-12-19 04:33:33,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:33,818 INFO L93 Difference]: Finished difference Result 50263 states and 182189 transitions. [2019-12-19 04:33:33,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:33:33,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-12-19 04:33:33,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:33,923 INFO L225 Difference]: With dead ends: 50263 [2019-12-19 04:33:33,923 INFO L226 Difference]: Without dead ends: 50263 [2019-12-19 04:33:33,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:34,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50263 states. [2019-12-19 04:33:34,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50263 to 43895. [2019-12-19 04:33:34,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43895 states. [2019-12-19 04:33:35,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43895 states to 43895 states and 160792 transitions. [2019-12-19 04:33:35,006 INFO L78 Accepts]: Start accepts. Automaton has 43895 states and 160792 transitions. Word has length 61 [2019-12-19 04:33:35,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:35,006 INFO L462 AbstractCegarLoop]: Abstraction has 43895 states and 160792 transitions. [2019-12-19 04:33:35,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:33:35,006 INFO L276 IsEmpty]: Start isEmpty. Operand 43895 states and 160792 transitions. [2019-12-19 04:33:35,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-19 04:33:35,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:35,042 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:35,042 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:35,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:35,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1371095923, now seen corresponding path program 1 times [2019-12-19 04:33:35,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:35,043 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931732475] [2019-12-19 04:33:35,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:35,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:35,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:35,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931732475] [2019-12-19 04:33:35,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:35,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:35,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109599124] [2019-12-19 04:33:35,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:35,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:35,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:35,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:35,168 INFO L87 Difference]: Start difference. First operand 43895 states and 160792 transitions. Second operand 7 states. [2019-12-19 04:33:36,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:36,500 INFO L93 Difference]: Finished difference Result 55891 states and 200526 transitions. [2019-12-19 04:33:36,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:33:36,500 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-19 04:33:36,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:36,622 INFO L225 Difference]: With dead ends: 55891 [2019-12-19 04:33:36,622 INFO L226 Difference]: Without dead ends: 55651 [2019-12-19 04:33:36,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:33:36,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55651 states. [2019-12-19 04:33:39,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55651 to 45121. [2019-12-19 04:33:39,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45121 states. [2019-12-19 04:33:39,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45121 states to 45121 states and 164959 transitions. [2019-12-19 04:33:39,333 INFO L78 Accepts]: Start accepts. Automaton has 45121 states and 164959 transitions. Word has length 65 [2019-12-19 04:33:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:39,334 INFO L462 AbstractCegarLoop]: Abstraction has 45121 states and 164959 transitions. [2019-12-19 04:33:39,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 45121 states and 164959 transitions. [2019-12-19 04:33:39,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:33:39,370 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:39,371 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:33:39,371 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:39,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:39,371 INFO L82 PathProgramCache]: Analyzing trace with hash -330249588, now seen corresponding path program 1 times [2019-12-19 04:33:39,372 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:39,372 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196521915] [2019-12-19 04:33:39,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:39,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-19 04:33:39,470 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196521915] [2019-12-19 04:33:39,470 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:39,470 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:33:39,471 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543023313] [2019-12-19 04:33:39,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:33:39,472 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:39,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:33:39,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:33:39,472 INFO L87 Difference]: Start difference. First operand 45121 states and 164959 transitions. Second operand 4 states. [2019-12-19 04:33:40,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:40,059 INFO L93 Difference]: Finished difference Result 69403 states and 252019 transitions. [2019-12-19 04:33:40,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:33:40,060 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 04:33:40,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:40,274 INFO L225 Difference]: With dead ends: 69403 [2019-12-19 04:33:40,274 INFO L226 Difference]: Without dead ends: 69403 [2019-12-19 04:33:40,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:40,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69403 states. [2019-12-19 04:33:41,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69403 to 53611. [2019-12-19 04:33:41,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53611 states. [2019-12-19 04:33:41,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53611 states to 53611 states and 195428 transitions. [2019-12-19 04:33:41,757 INFO L78 Accepts]: Start accepts. Automaton has 53611 states and 195428 transitions. Word has length 66 [2019-12-19 04:33:41,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:41,757 INFO L462 AbstractCegarLoop]: Abstraction has 53611 states and 195428 transitions. [2019-12-19 04:33:41,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:33:41,757 INFO L276 IsEmpty]: Start isEmpty. Operand 53611 states and 195428 transitions. [2019-12-19 04:33:41,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 04:33:41,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:41,796 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] [2019-12-19 04:33:41,796 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:41,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:41,796 INFO L82 PathProgramCache]: Analyzing trace with hash 434850924, now seen corresponding path program 1 times [2019-12-19 04:33:41,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:41,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861872555] [2019-12-19 04:33:41,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:42,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:42,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861872555] [2019-12-19 04:33:42,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:42,384 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:42,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924305220] [2019-12-19 04:33:42,384 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:42,385 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:42,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:42,385 INFO L87 Difference]: Start difference. First operand 53611 states and 195428 transitions. Second operand 7 states. [2019-12-19 04:33:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:43,602 INFO L93 Difference]: Finished difference Result 63822 states and 228895 transitions. [2019-12-19 04:33:43,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-19 04:33:43,603 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 04:33:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:43,740 INFO L225 Difference]: With dead ends: 63822 [2019-12-19 04:33:43,740 INFO L226 Difference]: Without dead ends: 63622 [2019-12-19 04:33:43,741 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-19 04:33:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63622 states. [2019-12-19 04:33:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63622 to 54380. [2019-12-19 04:33:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54380 states. [2019-12-19 04:33:46,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54380 states to 54380 states and 197958 transitions. [2019-12-19 04:33:46,775 INFO L78 Accepts]: Start accepts. Automaton has 54380 states and 197958 transitions. Word has length 66 [2019-12-19 04:33:46,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:46,776 INFO L462 AbstractCegarLoop]: Abstraction has 54380 states and 197958 transitions. [2019-12-19 04:33:46,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:46,776 INFO L276 IsEmpty]: Start isEmpty. Operand 54380 states and 197958 transitions. [2019-12-19 04:33:46,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:46,832 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:46,832 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-19 04:33:46,832 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:46,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:46,832 INFO L82 PathProgramCache]: Analyzing trace with hash 1137053182, now seen corresponding path program 1 times [2019-12-19 04:33:46,833 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:46,833 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639567408] [2019-12-19 04:33:46,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:46,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:46,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639567408] [2019-12-19 04:33:46,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:46,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:33:46,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996825470] [2019-12-19 04:33:46,935 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:33:46,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:46,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:33:46,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:33:46,935 INFO L87 Difference]: Start difference. First operand 54380 states and 197958 transitions. Second operand 6 states. [2019-12-19 04:33:47,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:47,713 INFO L93 Difference]: Finished difference Result 75817 states and 274672 transitions. [2019-12-19 04:33:47,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:33:47,714 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-19 04:33:47,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:47,885 INFO L225 Difference]: With dead ends: 75817 [2019-12-19 04:33:47,885 INFO L226 Difference]: Without dead ends: 75173 [2019-12-19 04:33:47,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:33:48,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75173 states. [2019-12-19 04:33:49,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75173 to 65280. [2019-12-19 04:33:49,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65280 states. [2019-12-19 04:33:49,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65280 states to 65280 states and 238125 transitions. [2019-12-19 04:33:49,618 INFO L78 Accepts]: Start accepts. Automaton has 65280 states and 238125 transitions. Word has length 68 [2019-12-19 04:33:49,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:49,618 INFO L462 AbstractCegarLoop]: Abstraction has 65280 states and 238125 transitions. [2019-12-19 04:33:49,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:33:49,618 INFO L276 IsEmpty]: Start isEmpty. Operand 65280 states and 238125 transitions. [2019-12-19 04:33:49,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:49,689 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:49,689 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-19 04:33:49,689 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:49,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:49,690 INFO L82 PathProgramCache]: Analyzing trace with hash 2098667199, now seen corresponding path program 1 times [2019-12-19 04:33:49,690 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:49,690 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944375181] [2019-12-19 04:33:49,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:49,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:50,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944375181] [2019-12-19 04:33:50,393 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:50,393 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:33:50,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766862025] [2019-12-19 04:33:50,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:33:50,394 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:50,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:33:50,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:33:50,394 INFO L87 Difference]: Start difference. First operand 65280 states and 238125 transitions. Second operand 7 states. [2019-12-19 04:33:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:51,566 INFO L93 Difference]: Finished difference Result 92241 states and 326467 transitions. [2019-12-19 04:33:51,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:33:51,566 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-19 04:33:51,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:51,774 INFO L225 Difference]: With dead ends: 92241 [2019-12-19 04:33:51,774 INFO L226 Difference]: Without dead ends: 92241 [2019-12-19 04:33:51,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:33:52,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92241 states. [2019-12-19 04:33:55,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92241 to 84350. [2019-12-19 04:33:55,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84350 states. [2019-12-19 04:33:55,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84350 states to 84350 states and 301234 transitions. [2019-12-19 04:33:55,852 INFO L78 Accepts]: Start accepts. Automaton has 84350 states and 301234 transitions. Word has length 68 [2019-12-19 04:33:55,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:55,852 INFO L462 AbstractCegarLoop]: Abstraction has 84350 states and 301234 transitions. [2019-12-19 04:33:55,852 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:33:55,852 INFO L276 IsEmpty]: Start isEmpty. Operand 84350 states and 301234 transitions. [2019-12-19 04:33:55,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-19 04:33:55,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:55,931 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-19 04:33:55,932 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:55,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:55,932 INFO L82 PathProgramCache]: Analyzing trace with hash -951535616, now seen corresponding path program 1 times [2019-12-19 04:33:55,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:55,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301678693] [2019-12-19 04:33:55,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:56,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:56,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301678693] [2019-12-19 04:33:56,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:56,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 04:33:56,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156182107] [2019-12-19 04:33:56,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 04:33:56,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:56,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 04:33:56,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 04:33:56,010 INFO L87 Difference]: Start difference. First operand 84350 states and 301234 transitions. Second operand 3 states. [2019-12-19 04:33:56,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:56,327 INFO L93 Difference]: Finished difference Result 63509 states and 230498 transitions. [2019-12-19 04:33:56,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 04:33:56,327 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-12-19 04:33:56,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:33:57,122 INFO L225 Difference]: With dead ends: 63509 [2019-12-19 04:33:57,122 INFO L226 Difference]: Without dead ends: 63347 [2019-12-19 04:33:57,123 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-19 04:33:57,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63347 states. [2019-12-19 04:33:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63347 to 63307. [2019-12-19 04:33:58,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63307 states. [2019-12-19 04:33:58,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63307 states to 63307 states and 229913 transitions. [2019-12-19 04:33:58,220 INFO L78 Accepts]: Start accepts. Automaton has 63307 states and 229913 transitions. Word has length 68 [2019-12-19 04:33:58,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:33:58,220 INFO L462 AbstractCegarLoop]: Abstraction has 63307 states and 229913 transitions. [2019-12-19 04:33:58,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 04:33:58,220 INFO L276 IsEmpty]: Start isEmpty. Operand 63307 states and 229913 transitions. [2019-12-19 04:33:58,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 04:33:58,268 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:33:58,268 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] [2019-12-19 04:33:58,269 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:33:58,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:33:58,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1567683976, now seen corresponding path program 1 times [2019-12-19 04:33:58,269 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:33:58,269 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717536495] [2019-12-19 04:33:58,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:33:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:33:58,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:33:58,351 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717536495] [2019-12-19 04:33:58,352 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:33:58,352 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:33:58,352 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306618251] [2019-12-19 04:33:58,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:33:58,353 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:33:58,353 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:33:58,353 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:33:58,353 INFO L87 Difference]: Start difference. First operand 63307 states and 229913 transitions. Second operand 5 states. [2019-12-19 04:33:59,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:33:59,802 INFO L93 Difference]: Finished difference Result 84435 states and 303683 transitions. [2019-12-19 04:33:59,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:33:59,802 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 04:33:59,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:00,097 INFO L225 Difference]: With dead ends: 84435 [2019-12-19 04:34:00,097 INFO L226 Difference]: Without dead ends: 84239 [2019-12-19 04:34:00,098 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-19 04:34:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84239 states. [2019-12-19 04:34:01,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84239 to 76154. [2019-12-19 04:34:01,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76154 states. [2019-12-19 04:34:04,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76154 states to 76154 states and 275571 transitions. [2019-12-19 04:34:04,936 INFO L78 Accepts]: Start accepts. Automaton has 76154 states and 275571 transitions. Word has length 69 [2019-12-19 04:34:04,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:04,937 INFO L462 AbstractCegarLoop]: Abstraction has 76154 states and 275571 transitions. [2019-12-19 04:34:04,937 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:04,937 INFO L276 IsEmpty]: Start isEmpty. Operand 76154 states and 275571 transitions. [2019-12-19 04:34:05,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 04:34:05,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:05,014 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] [2019-12-19 04:34:05,015 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:05,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:05,015 INFO L82 PathProgramCache]: Analyzing trace with hash -322919495, now seen corresponding path program 1 times [2019-12-19 04:34:05,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:05,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513190275] [2019-12-19 04:34:05,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:05,086 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513190275] [2019-12-19 04:34:05,086 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:05,086 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:05,087 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553789225] [2019-12-19 04:34:05,087 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:05,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:05,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:05,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:05,088 INFO L87 Difference]: Start difference. First operand 76154 states and 275571 transitions. Second operand 4 states. [2019-12-19 04:34:05,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:05,202 INFO L93 Difference]: Finished difference Result 19622 states and 62292 transitions. [2019-12-19 04:34:05,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:05,203 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 04:34:05,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:05,236 INFO L225 Difference]: With dead ends: 19622 [2019-12-19 04:34:05,236 INFO L226 Difference]: Without dead ends: 19144 [2019-12-19 04:34:05,236 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:05,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19144 states. [2019-12-19 04:34:05,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19144 to 19132. [2019-12-19 04:34:05,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19132 states. [2019-12-19 04:34:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19132 states to 19132 states and 60787 transitions. [2019-12-19 04:34:05,489 INFO L78 Accepts]: Start accepts. Automaton has 19132 states and 60787 transitions. Word has length 69 [2019-12-19 04:34:05,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:05,490 INFO L462 AbstractCegarLoop]: Abstraction has 19132 states and 60787 transitions. [2019-12-19 04:34:05,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 19132 states and 60787 transitions. [2019-12-19 04:34:05,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:34:05,511 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:05,511 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:05,511 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:05,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:05,512 INFO L82 PathProgramCache]: Analyzing trace with hash 992958347, now seen corresponding path program 1 times [2019-12-19 04:34:05,512 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:05,512 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957501338] [2019-12-19 04:34:05,512 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:05,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:05,571 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957501338] [2019-12-19 04:34:05,571 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:05,571 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:05,572 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599629921] [2019-12-19 04:34:05,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:05,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:05,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:05,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:05,573 INFO L87 Difference]: Start difference. First operand 19132 states and 60787 transitions. Second operand 4 states. [2019-12-19 04:34:05,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:05,844 INFO L93 Difference]: Finished difference Result 24082 states and 75455 transitions. [2019-12-19 04:34:05,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 04:34:05,845 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-12-19 04:34:05,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:05,884 INFO L225 Difference]: With dead ends: 24082 [2019-12-19 04:34:05,884 INFO L226 Difference]: Without dead ends: 24082 [2019-12-19 04:34:05,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:05,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24082 states. [2019-12-19 04:34:06,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24082 to 19972. [2019-12-19 04:34:06,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19972 states. [2019-12-19 04:34:06,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19972 states to 19972 states and 63154 transitions. [2019-12-19 04:34:06,175 INFO L78 Accepts]: Start accepts. Automaton has 19972 states and 63154 transitions. Word has length 78 [2019-12-19 04:34:06,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:06,175 INFO L462 AbstractCegarLoop]: Abstraction has 19972 states and 63154 transitions. [2019-12-19 04:34:06,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:06,175 INFO L276 IsEmpty]: Start isEmpty. Operand 19972 states and 63154 transitions. [2019-12-19 04:34:06,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-12-19 04:34:06,192 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:06,192 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:06,192 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:06,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:06,193 INFO L82 PathProgramCache]: Analyzing trace with hash 738221802, now seen corresponding path program 1 times [2019-12-19 04:34:06,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:06,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279239908] [2019-12-19 04:34:06,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:06,287 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279239908] [2019-12-19 04:34:06,287 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:06,287 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:34:06,288 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752943649] [2019-12-19 04:34:06,288 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:34:06,288 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:06,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:34:06,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:06,289 INFO L87 Difference]: Start difference. First operand 19972 states and 63154 transitions. Second operand 8 states. [2019-12-19 04:34:07,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:07,207 INFO L93 Difference]: Finished difference Result 22078 states and 69346 transitions. [2019-12-19 04:34:07,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-19 04:34:07,208 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2019-12-19 04:34:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:07,242 INFO L225 Difference]: With dead ends: 22078 [2019-12-19 04:34:07,242 INFO L226 Difference]: Without dead ends: 22030 [2019-12-19 04:34:07,243 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-19 04:34:07,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22030 states. [2019-12-19 04:34:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22030 to 19444. [2019-12-19 04:34:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19444 states. [2019-12-19 04:34:07,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19444 states to 19444 states and 61656 transitions. [2019-12-19 04:34:07,847 INFO L78 Accepts]: Start accepts. Automaton has 19444 states and 61656 transitions. Word has length 78 [2019-12-19 04:34:07,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:07,848 INFO L462 AbstractCegarLoop]: Abstraction has 19444 states and 61656 transitions. [2019-12-19 04:34:07,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:34:07,848 INFO L276 IsEmpty]: Start isEmpty. Operand 19444 states and 61656 transitions. [2019-12-19 04:34:07,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:07,867 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:07,867 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] [2019-12-19 04:34:07,868 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:07,868 INFO L82 PathProgramCache]: Analyzing trace with hash -1156410968, now seen corresponding path program 1 times [2019-12-19 04:34:07,868 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:07,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446575714] [2019-12-19 04:34:07,869 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:07,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:07,965 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446575714] [2019-12-19 04:34:07,965 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:07,965 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-19 04:34:07,965 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074536672] [2019-12-19 04:34:07,966 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-19 04:34:07,966 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:07,966 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-19 04:34:07,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:07,967 INFO L87 Difference]: Start difference. First operand 19444 states and 61656 transitions. Second operand 8 states. [2019-12-19 04:34:10,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:10,605 INFO L93 Difference]: Finished difference Result 50438 states and 153674 transitions. [2019-12-19 04:34:10,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-19 04:34:10,606 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 81 [2019-12-19 04:34:10,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:10,687 INFO L225 Difference]: With dead ends: 50438 [2019-12-19 04:34:10,687 INFO L226 Difference]: Without dead ends: 49739 [2019-12-19 04:34:10,687 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-19 04:34:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49739 states. [2019-12-19 04:34:11,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49739 to 29972. [2019-12-19 04:34:11,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29972 states. [2019-12-19 04:34:11,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29972 states to 29972 states and 93586 transitions. [2019-12-19 04:34:11,243 INFO L78 Accepts]: Start accepts. Automaton has 29972 states and 93586 transitions. Word has length 81 [2019-12-19 04:34:11,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:11,243 INFO L462 AbstractCegarLoop]: Abstraction has 29972 states and 93586 transitions. [2019-12-19 04:34:11,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-19 04:34:11,243 INFO L276 IsEmpty]: Start isEmpty. Operand 29972 states and 93586 transitions. [2019-12-19 04:34:11,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:11,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:11,276 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] [2019-12-19 04:34:11,276 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:11,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:11,276 INFO L82 PathProgramCache]: Analyzing trace with hash -194796951, now seen corresponding path program 1 times [2019-12-19 04:34:11,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:11,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765451548] [2019-12-19 04:34:11,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:11,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:11,370 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765451548] [2019-12-19 04:34:11,370 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:11,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:11,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342654739] [2019-12-19 04:34:11,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:11,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:11,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:11,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:11,372 INFO L87 Difference]: Start difference. First operand 29972 states and 93586 transitions. Second operand 6 states. [2019-12-19 04:34:11,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:11,871 INFO L93 Difference]: Finished difference Result 31402 states and 97511 transitions. [2019-12-19 04:34:11,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:11,872 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 81 [2019-12-19 04:34:11,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:11,921 INFO L225 Difference]: With dead ends: 31402 [2019-12-19 04:34:11,922 INFO L226 Difference]: Without dead ends: 31402 [2019-12-19 04:34:11,922 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:11,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31402 states. [2019-12-19 04:34:12,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31402 to 29633. [2019-12-19 04:34:12,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29633 states. [2019-12-19 04:34:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29633 states to 29633 states and 92417 transitions. [2019-12-19 04:34:12,634 INFO L78 Accepts]: Start accepts. Automaton has 29633 states and 92417 transitions. Word has length 81 [2019-12-19 04:34:12,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:12,635 INFO L462 AbstractCegarLoop]: Abstraction has 29633 states and 92417 transitions. [2019-12-19 04:34:12,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 29633 states and 92417 transitions. [2019-12-19 04:34:12,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:12,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:12,663 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] [2019-12-19 04:34:12,663 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:12,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:12,663 INFO L82 PathProgramCache]: Analyzing trace with hash -2130457238, now seen corresponding path program 1 times [2019-12-19 04:34:12,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:12,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213195631] [2019-12-19 04:34:12,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:12,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:12,778 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213195631] [2019-12-19 04:34:12,778 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:12,778 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:12,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187108746] [2019-12-19 04:34:12,780 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:12,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:12,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:12,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:12,781 INFO L87 Difference]: Start difference. First operand 29633 states and 92417 transitions. Second operand 7 states. [2019-12-19 04:34:13,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:13,368 INFO L93 Difference]: Finished difference Result 31147 states and 96573 transitions. [2019-12-19 04:34:13,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 04:34:13,369 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-12-19 04:34:13,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:13,417 INFO L225 Difference]: With dead ends: 31147 [2019-12-19 04:34:13,419 INFO L226 Difference]: Without dead ends: 31147 [2019-12-19 04:34:13,420 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 04:34:13,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31147 states. [2019-12-19 04:34:13,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31147 to 29965. [2019-12-19 04:34:13,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29965 states. [2019-12-19 04:34:13,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29965 states to 29965 states and 93248 transitions. [2019-12-19 04:34:13,831 INFO L78 Accepts]: Start accepts. Automaton has 29965 states and 93248 transitions. Word has length 81 [2019-12-19 04:34:13,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:13,831 INFO L462 AbstractCegarLoop]: Abstraction has 29965 states and 93248 transitions. [2019-12-19 04:34:13,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:13,831 INFO L276 IsEmpty]: Start isEmpty. Operand 29965 states and 93248 transitions. [2019-12-19 04:34:13,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-19 04:34:13,860 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:13,860 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] [2019-12-19 04:34:13,861 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:13,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:13,861 INFO L82 PathProgramCache]: Analyzing trace with hash -1800691477, now seen corresponding path program 1 times [2019-12-19 04:34:13,861 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:13,861 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227700800] [2019-12-19 04:34:13,861 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:13,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227700800] [2019-12-19 04:34:13,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:13,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:13,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253361110] [2019-12-19 04:34:13,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:13,959 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:13,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:13,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:13,959 INFO L87 Difference]: Start difference. First operand 29965 states and 93248 transitions. Second operand 5 states. [2019-12-19 04:34:14,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:14,014 INFO L93 Difference]: Finished difference Result 4528 states and 11184 transitions. [2019-12-19 04:34:14,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 04:34:14,014 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-12-19 04:34:14,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:14,020 INFO L225 Difference]: With dead ends: 4528 [2019-12-19 04:34:14,020 INFO L226 Difference]: Without dead ends: 3738 [2019-12-19 04:34:14,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:14,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3738 states. [2019-12-19 04:34:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3738 to 3435. [2019-12-19 04:34:14,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3435 states. [2019-12-19 04:34:14,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3435 states to 3435 states and 8385 transitions. [2019-12-19 04:34:14,071 INFO L78 Accepts]: Start accepts. Automaton has 3435 states and 8385 transitions. Word has length 81 [2019-12-19 04:34:14,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:14,071 INFO L462 AbstractCegarLoop]: Abstraction has 3435 states and 8385 transitions. [2019-12-19 04:34:14,071 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:14,072 INFO L276 IsEmpty]: Start isEmpty. Operand 3435 states and 8385 transitions. [2019-12-19 04:34:14,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:14,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:14,076 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] [2019-12-19 04:34:14,077 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:14,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:14,077 INFO L82 PathProgramCache]: Analyzing trace with hash 636830190, now seen corresponding path program 1 times [2019-12-19 04:34:14,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:14,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146612460] [2019-12-19 04:34:14,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:14,226 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146612460] [2019-12-19 04:34:14,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:14,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:14,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472952099] [2019-12-19 04:34:14,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:14,227 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:14,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:14,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:14,228 INFO L87 Difference]: Start difference. First operand 3435 states and 8385 transitions. Second operand 6 states. [2019-12-19 04:34:14,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:14,538 INFO L93 Difference]: Finished difference Result 3465 states and 8375 transitions. [2019-12-19 04:34:14,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:34:14,538 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:34:14,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:14,543 INFO L225 Difference]: With dead ends: 3465 [2019-12-19 04:34:14,544 INFO L226 Difference]: Without dead ends: 3465 [2019-12-19 04:34:14,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:34:14,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3465 states. [2019-12-19 04:34:14,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3465 to 3315. [2019-12-19 04:34:14,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3315 states. [2019-12-19 04:34:14,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 8065 transitions. [2019-12-19 04:34:14,576 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 8065 transitions. Word has length 93 [2019-12-19 04:34:14,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:14,576 INFO L462 AbstractCegarLoop]: Abstraction has 3315 states and 8065 transitions. [2019-12-19 04:34:14,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 8065 transitions. [2019-12-19 04:34:14,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:14,579 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:14,580 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] [2019-12-19 04:34:14,580 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:14,580 INFO L82 PathProgramCache]: Analyzing trace with hash 966595951, now seen corresponding path program 1 times [2019-12-19 04:34:14,580 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:14,581 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775292360] [2019-12-19 04:34:14,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:14,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775292360] [2019-12-19 04:34:14,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:14,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 04:34:14,638 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259600005] [2019-12-19 04:34:14,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 04:34:14,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:14,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 04:34:14,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:14,639 INFO L87 Difference]: Start difference. First operand 3315 states and 8065 transitions. Second operand 4 states. [2019-12-19 04:34:14,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:14,788 INFO L93 Difference]: Finished difference Result 4130 states and 9838 transitions. [2019-12-19 04:34:14,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 04:34:14,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-19 04:34:14,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:14,794 INFO L225 Difference]: With dead ends: 4130 [2019-12-19 04:34:14,794 INFO L226 Difference]: Without dead ends: 4073 [2019-12-19 04:34:14,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 04:34:14,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4073 states. [2019-12-19 04:34:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4073 to 3580. [2019-12-19 04:34:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3580 states. [2019-12-19 04:34:14,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3580 states to 3580 states and 8651 transitions. [2019-12-19 04:34:14,830 INFO L78 Accepts]: Start accepts. Automaton has 3580 states and 8651 transitions. Word has length 93 [2019-12-19 04:34:14,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:14,831 INFO L462 AbstractCegarLoop]: Abstraction has 3580 states and 8651 transitions. [2019-12-19 04:34:14,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 04:34:14,831 INFO L276 IsEmpty]: Start isEmpty. Operand 3580 states and 8651 transitions. [2019-12-19 04:34:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:14,834 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:14,834 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] [2019-12-19 04:34:14,834 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:14,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:14,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1662428928, now seen corresponding path program 1 times [2019-12-19 04:34:14,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:14,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054054882] [2019-12-19 04:34:14,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:14,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:14,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:14,905 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054054882] [2019-12-19 04:34:14,905 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:14,906 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:14,906 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141108154] [2019-12-19 04:34:14,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:14,906 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:14,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:14,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:14,907 INFO L87 Difference]: Start difference. First operand 3580 states and 8651 transitions. Second operand 5 states. [2019-12-19 04:34:15,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:15,538 INFO L93 Difference]: Finished difference Result 5452 states and 13125 transitions. [2019-12-19 04:34:15,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:15,539 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:34:15,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:15,545 INFO L225 Difference]: With dead ends: 5452 [2019-12-19 04:34:15,545 INFO L226 Difference]: Without dead ends: 5452 [2019-12-19 04:34:15,546 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5452 states. [2019-12-19 04:34:15,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5452 to 3913. [2019-12-19 04:34:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3913 states. [2019-12-19 04:34:15,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3913 states to 3913 states and 9527 transitions. [2019-12-19 04:34:15,590 INFO L78 Accepts]: Start accepts. Automaton has 3913 states and 9527 transitions. Word has length 93 [2019-12-19 04:34:15,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:15,590 INFO L462 AbstractCegarLoop]: Abstraction has 3913 states and 9527 transitions. [2019-12-19 04:34:15,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:15,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3913 states and 9527 transitions. [2019-12-19 04:34:15,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:15,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:15,594 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] [2019-12-19 04:34:15,594 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:15,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:15,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1945579392, now seen corresponding path program 1 times [2019-12-19 04:34:15,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:15,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173959163] [2019-12-19 04:34:15,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:15,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173959163] [2019-12-19 04:34:15,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:15,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:15,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069843166] [2019-12-19 04:34:15,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:15,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:15,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:15,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:15,701 INFO L87 Difference]: Start difference. First operand 3913 states and 9527 transitions. Second operand 6 states. [2019-12-19 04:34:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:15,923 INFO L93 Difference]: Finished difference Result 4703 states and 11075 transitions. [2019-12-19 04:34:15,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 04:34:15,924 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:34:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:15,930 INFO L225 Difference]: With dead ends: 4703 [2019-12-19 04:34:15,931 INFO L226 Difference]: Without dead ends: 4703 [2019-12-19 04:34:15,931 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-19 04:34:15,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4703 states. [2019-12-19 04:34:15,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4703 to 4080. [2019-12-19 04:34:15,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4080 states. [2019-12-19 04:34:16,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4080 states to 4080 states and 9838 transitions. [2019-12-19 04:34:16,123 INFO L78 Accepts]: Start accepts. Automaton has 4080 states and 9838 transitions. Word has length 93 [2019-12-19 04:34:16,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:16,124 INFO L462 AbstractCegarLoop]: Abstraction has 4080 states and 9838 transitions. [2019-12-19 04:34:16,124 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:16,124 INFO L276 IsEmpty]: Start isEmpty. Operand 4080 states and 9838 transitions. [2019-12-19 04:34:16,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:16,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:16,128 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] [2019-12-19 04:34:16,128 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:16,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:16,129 INFO L82 PathProgramCache]: Analyzing trace with hash 648647425, now seen corresponding path program 1 times [2019-12-19 04:34:16,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:16,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949496532] [2019-12-19 04:34:16,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:16,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:16,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949496532] [2019-12-19 04:34:16,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:16,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:16,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357463983] [2019-12-19 04:34:16,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:16,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:16,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:16,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:16,199 INFO L87 Difference]: Start difference. First operand 4080 states and 9838 transitions. Second operand 5 states. [2019-12-19 04:34:16,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:16,514 INFO L93 Difference]: Finished difference Result 4870 states and 11542 transitions. [2019-12-19 04:34:16,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:16,514 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 04:34:16,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:16,523 INFO L225 Difference]: With dead ends: 4870 [2019-12-19 04:34:16,523 INFO L226 Difference]: Without dead ends: 4824 [2019-12-19 04:34:16,523 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:16,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4824 states. [2019-12-19 04:34:16,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4824 to 4158. [2019-12-19 04:34:16,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4158 states. [2019-12-19 04:34:16,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4158 states to 4158 states and 10005 transitions. [2019-12-19 04:34:16,590 INFO L78 Accepts]: Start accepts. Automaton has 4158 states and 10005 transitions. Word has length 93 [2019-12-19 04:34:16,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:16,590 INFO L462 AbstractCegarLoop]: Abstraction has 4158 states and 10005 transitions. [2019-12-19 04:34:16,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 4158 states and 10005 transitions. [2019-12-19 04:34:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:16,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:16,596 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] [2019-12-19 04:34:16,596 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:16,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:16,596 INFO L82 PathProgramCache]: Analyzing trace with hash 970728323, now seen corresponding path program 1 times [2019-12-19 04:34:16,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:16,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711555790] [2019-12-19 04:34:16,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:16,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:16,693 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711555790] [2019-12-19 04:34:16,694 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:16,694 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:16,694 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24898951] [2019-12-19 04:34:16,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:16,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:16,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:16,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:16,695 INFO L87 Difference]: Start difference. First operand 4158 states and 10005 transitions. Second operand 7 states. [2019-12-19 04:34:17,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:17,279 INFO L93 Difference]: Finished difference Result 5046 states and 11917 transitions. [2019-12-19 04:34:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-19 04:34:17,279 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-19 04:34:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:17,287 INFO L225 Difference]: With dead ends: 5046 [2019-12-19 04:34:17,287 INFO L226 Difference]: Without dead ends: 5002 [2019-12-19 04:34:17,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2019-12-19 04:34:17,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5002 states. [2019-12-19 04:34:17,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5002 to 4203. [2019-12-19 04:34:17,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4203 states. [2019-12-19 04:34:17,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4203 states to 4203 states and 10074 transitions. [2019-12-19 04:34:17,352 INFO L78 Accepts]: Start accepts. Automaton has 4203 states and 10074 transitions. Word has length 93 [2019-12-19 04:34:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:17,353 INFO L462 AbstractCegarLoop]: Abstraction has 4203 states and 10074 transitions. [2019-12-19 04:34:17,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4203 states and 10074 transitions. [2019-12-19 04:34:17,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 04:34:17,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:17,359 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] [2019-12-19 04:34:17,359 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:17,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:17,360 INFO L82 PathProgramCache]: Analyzing trace with hash 83557860, now seen corresponding path program 1 times [2019-12-19 04:34:17,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:17,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85585042] [2019-12-19 04:34:17,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:17,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85585042] [2019-12-19 04:34:17,441 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:17,441 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:17,441 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095393555] [2019-12-19 04:34:17,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:17,442 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:17,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:17,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:17,442 INFO L87 Difference]: Start difference. First operand 4203 states and 10074 transitions. Second operand 6 states. [2019-12-19 04:34:17,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:17,558 INFO L93 Difference]: Finished difference Result 3248 states and 7928 transitions. [2019-12-19 04:34:17,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:17,558 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-19 04:34:17,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:17,564 INFO L225 Difference]: With dead ends: 3248 [2019-12-19 04:34:17,564 INFO L226 Difference]: Without dead ends: 3248 [2019-12-19 04:34:17,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:17,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3248 states. [2019-12-19 04:34:17,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3248 to 2988. [2019-12-19 04:34:17,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-19 04:34:17,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 7372 transitions. [2019-12-19 04:34:17,627 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 7372 transitions. Word has length 93 [2019-12-19 04:34:17,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:17,627 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 7372 transitions. [2019-12-19 04:34:17,627 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 7372 transitions. [2019-12-19 04:34:17,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:17,631 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:17,632 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-19 04:34:17,632 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:17,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:17,632 INFO L82 PathProgramCache]: Analyzing trace with hash -1079948161, now seen corresponding path program 1 times [2019-12-19 04:34:17,633 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:17,633 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847385486] [2019-12-19 04:34:17,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:17,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:17,760 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847385486] [2019-12-19 04:34:17,760 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:17,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:17,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295347846] [2019-12-19 04:34:17,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:17,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:17,762 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:17,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:17,762 INFO L87 Difference]: Start difference. First operand 2988 states and 7372 transitions. Second operand 6 states. [2019-12-19 04:34:17,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:17,876 INFO L93 Difference]: Finished difference Result 3169 states and 7662 transitions. [2019-12-19 04:34:17,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:17,877 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:34:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:17,883 INFO L225 Difference]: With dead ends: 3169 [2019-12-19 04:34:17,883 INFO L226 Difference]: Without dead ends: 3124 [2019-12-19 04:34:17,884 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:17,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3124 states. [2019-12-19 04:34:17,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3124 to 3050. [2019-12-19 04:34:17,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3050 states. [2019-12-19 04:34:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3050 states to 3050 states and 7431 transitions. [2019-12-19 04:34:17,941 INFO L78 Accepts]: Start accepts. Automaton has 3050 states and 7431 transitions. Word has length 95 [2019-12-19 04:34:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:17,941 INFO L462 AbstractCegarLoop]: Abstraction has 3050 states and 7431 transitions. [2019-12-19 04:34:17,941 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 3050 states and 7431 transitions. [2019-12-19 04:34:17,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:17,947 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34: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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 04:34:17,948 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:17,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:17,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1737866465, now seen corresponding path program 2 times [2019-12-19 04:34:17,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:17,949 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340840425] [2019-12-19 04:34:17,949 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:17,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:18,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:18,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340840425] [2019-12-19 04:34:18,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:18,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:18,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087419156] [2019-12-19 04:34:18,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:18,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:18,076 INFO L87 Difference]: Start difference. First operand 3050 states and 7431 transitions. Second operand 6 states. [2019-12-19 04:34:18,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:18,270 INFO L93 Difference]: Finished difference Result 3282 states and 7887 transitions. [2019-12-19 04:34:18,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 04:34:18,271 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:34:18,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:18,274 INFO L225 Difference]: With dead ends: 3282 [2019-12-19 04:34:18,274 INFO L226 Difference]: Without dead ends: 3282 [2019-12-19 04:34:18,275 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:34:18,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3282 states. [2019-12-19 04:34:18,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3282 to 3176. [2019-12-19 04:34:18,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3176 states. [2019-12-19 04:34:18,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3176 states to 3176 states and 7680 transitions. [2019-12-19 04:34:18,306 INFO L78 Accepts]: Start accepts. Automaton has 3176 states and 7680 transitions. Word has length 95 [2019-12-19 04:34:18,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:18,306 INFO L462 AbstractCegarLoop]: Abstraction has 3176 states and 7680 transitions. [2019-12-19 04:34:18,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:18,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3176 states and 7680 transitions. [2019-12-19 04:34:18,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:18,309 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:18,309 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-19 04:34:18,310 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:18,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:18,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1408100704, now seen corresponding path program 1 times [2019-12-19 04:34:18,310 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:18,310 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928433586] [2019-12-19 04:34:18,310 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:18,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:18,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928433586] [2019-12-19 04:34:18,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:18,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:18,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910314421] [2019-12-19 04:34:18,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:18,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:18,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:18,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:18,381 INFO L87 Difference]: Start difference. First operand 3176 states and 7680 transitions. Second operand 5 states. [2019-12-19 04:34:18,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:18,509 INFO L93 Difference]: Finished difference Result 3783 states and 8972 transitions. [2019-12-19 04:34:18,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:18,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:34:18,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:18,515 INFO L225 Difference]: With dead ends: 3783 [2019-12-19 04:34:18,515 INFO L226 Difference]: Without dead ends: 3783 [2019-12-19 04:34:18,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:18,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3783 states. [2019-12-19 04:34:18,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3783 to 3514. [2019-12-19 04:34:18,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3514 states. [2019-12-19 04:34:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3514 states to 3514 states and 8390 transitions. [2019-12-19 04:34:18,556 INFO L78 Accepts]: Start accepts. Automaton has 3514 states and 8390 transitions. Word has length 95 [2019-12-19 04:34:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:18,556 INFO L462 AbstractCegarLoop]: Abstraction has 3514 states and 8390 transitions. [2019-12-19 04:34:18,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 3514 states and 8390 transitions. [2019-12-19 04:34:18,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:18,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:18,560 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-19 04:34:18,560 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:18,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:18,560 INFO L82 PathProgramCache]: Analyzing trace with hash 593612287, now seen corresponding path program 1 times [2019-12-19 04:34:18,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:18,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802706230] [2019-12-19 04:34:18,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:18,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:18,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:18,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802706230] [2019-12-19 04:34:18,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:18,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 04:34:18,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1962923575] [2019-12-19 04:34:18,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 04:34:18,646 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:18,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 04:34:18,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 04:34:18,647 INFO L87 Difference]: Start difference. First operand 3514 states and 8390 transitions. Second operand 5 states. [2019-12-19 04:34:18,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:18,844 INFO L93 Difference]: Finished difference Result 3181 states and 7442 transitions. [2019-12-19 04:34:18,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:18,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 04:34:18,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:18,849 INFO L225 Difference]: With dead ends: 3181 [2019-12-19 04:34:18,849 INFO L226 Difference]: Without dead ends: 3163 [2019-12-19 04:34:18,849 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:18,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3163 states. [2019-12-19 04:34:18,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3163 to 2489. [2019-12-19 04:34:18,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2489 states. [2019-12-19 04:34:18,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2489 states to 2489 states and 5939 transitions. [2019-12-19 04:34:18,876 INFO L78 Accepts]: Start accepts. Automaton has 2489 states and 5939 transitions. Word has length 95 [2019-12-19 04:34:18,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:18,877 INFO L462 AbstractCegarLoop]: Abstraction has 2489 states and 5939 transitions. [2019-12-19 04:34:18,877 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 04:34:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2489 states and 5939 transitions. [2019-12-19 04:34:18,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:18,879 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:18,879 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-19 04:34:18,879 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:18,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:18,880 INFO L82 PathProgramCache]: Analyzing trace with hash 1838376768, now seen corresponding path program 1 times [2019-12-19 04:34:18,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:18,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257987044] [2019-12-19 04:34:18,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:18,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-19 04:34:18,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257987044] [2019-12-19 04:34:18,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:18,949 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 04:34:18,949 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680157520] [2019-12-19 04:34:18,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 04:34:18,949 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:18,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 04:34:18,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 04:34:18,950 INFO L87 Difference]: Start difference. First operand 2489 states and 5939 transitions. Second operand 6 states. [2019-12-19 04:34:19,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:19,083 INFO L93 Difference]: Finished difference Result 2568 states and 6098 transitions. [2019-12-19 04:34:19,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 04:34:19,083 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 04:34:19,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:19,086 INFO L225 Difference]: With dead ends: 2568 [2019-12-19 04:34:19,086 INFO L226 Difference]: Without dead ends: 2568 [2019-12-19 04:34:19,087 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 04:34:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2568 states. [2019-12-19 04:34:19,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2568 to 2463. [2019-12-19 04:34:19,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2463 states. [2019-12-19 04:34:19,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2463 states to 2463 states and 5887 transitions. [2019-12-19 04:34:19,111 INFO L78 Accepts]: Start accepts. Automaton has 2463 states and 5887 transitions. Word has length 95 [2019-12-19 04:34:19,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:19,111 INFO L462 AbstractCegarLoop]: Abstraction has 2463 states and 5887 transitions. [2019-12-19 04:34:19,111 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 04:34:19,111 INFO L276 IsEmpty]: Start isEmpty. Operand 2463 states and 5887 transitions. [2019-12-19 04:34:19,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:19,113 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:19,114 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-19 04:34:19,114 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:19,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:19,114 INFO L82 PathProgramCache]: Analyzing trace with hash -2136197344, now seen corresponding path program 1 times [2019-12-19 04:34:19,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:19,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378245346] [2019-12-19 04:34:19,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:19,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:19,213 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:19,214 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378245346] [2019-12-19 04:34:19,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:19,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:19,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183768374] [2019-12-19 04:34:19,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:19,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:19,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:19,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:19,215 INFO L87 Difference]: Start difference. First operand 2463 states and 5887 transitions. Second operand 7 states. [2019-12-19 04:34:19,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:19,478 INFO L93 Difference]: Finished difference Result 2673 states and 6279 transitions. [2019-12-19 04:34:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:34:19,478 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 04:34:19,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:19,481 INFO L225 Difference]: With dead ends: 2673 [2019-12-19 04:34:19,482 INFO L226 Difference]: Without dead ends: 2673 [2019-12-19 04:34:19,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2019-12-19 04:34:19,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2019-12-19 04:34:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2479. [2019-12-19 04:34:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2479 states. [2019-12-19 04:34:19,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2479 states to 2479 states and 5898 transitions. [2019-12-19 04:34:19,506 INFO L78 Accepts]: Start accepts. Automaton has 2479 states and 5898 transitions. Word has length 95 [2019-12-19 04:34:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:19,506 INFO L462 AbstractCegarLoop]: Abstraction has 2479 states and 5898 transitions. [2019-12-19 04:34:19,506 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:19,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2479 states and 5898 transitions. [2019-12-19 04:34:19,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:19,509 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:19,509 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-19 04:34:19,509 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:19,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:19,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1806431583, now seen corresponding path program 1 times [2019-12-19 04:34:19,510 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:19,510 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987459712] [2019-12-19 04:34:19,510 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:19,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:19,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:19,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987459712] [2019-12-19 04:34:19,618 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:19,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 04:34:19,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965226608] [2019-12-19 04:34:19,619 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 04:34:19,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:19,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 04:34:19,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 04:34:19,619 INFO L87 Difference]: Start difference. First operand 2479 states and 5898 transitions. Second operand 7 states. [2019-12-19 04:34:19,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:19,719 INFO L93 Difference]: Finished difference Result 4150 states and 10020 transitions. [2019-12-19 04:34:19,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 04:34:19,719 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-12-19 04:34:19,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:19,722 INFO L225 Difference]: With dead ends: 4150 [2019-12-19 04:34:19,722 INFO L226 Difference]: Without dead ends: 1889 [2019-12-19 04:34:19,723 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:34:19,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2019-12-19 04:34:19,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1889. [2019-12-19 04:34:19,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1889 states. [2019-12-19 04:34:19,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1889 states to 1889 states and 4536 transitions. [2019-12-19 04:34:19,743 INFO L78 Accepts]: Start accepts. Automaton has 1889 states and 4536 transitions. Word has length 95 [2019-12-19 04:34:19,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:19,743 INFO L462 AbstractCegarLoop]: Abstraction has 1889 states and 4536 transitions. [2019-12-19 04:34:19,743 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 04:34:19,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1889 states and 4536 transitions. [2019-12-19 04:34:19,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:19,745 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:19,745 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-19 04:34:19,745 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:19,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:19,746 INFO L82 PathProgramCache]: Analyzing trace with hash -2061196609, now seen corresponding path program 2 times [2019-12-19 04:34:19,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:19,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457650815] [2019-12-19 04:34:19,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 04:34:19,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 04:34:19,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457650815] [2019-12-19 04:34:19,886 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 04:34:19,886 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-19 04:34:19,886 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030025898] [2019-12-19 04:34:19,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-19 04:34:19,886 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 04:34:19,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-19 04:34:19,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-12-19 04:34:19,887 INFO L87 Difference]: Start difference. First operand 1889 states and 4536 transitions. Second operand 11 states. [2019-12-19 04:34:20,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 04:34:20,132 INFO L93 Difference]: Finished difference Result 3402 states and 8265 transitions. [2019-12-19 04:34:20,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 04:34:20,133 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2019-12-19 04:34:20,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 04:34:20,136 INFO L225 Difference]: With dead ends: 3402 [2019-12-19 04:34:20,136 INFO L226 Difference]: Without dead ends: 2502 [2019-12-19 04:34:20,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2019-12-19 04:34:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2502 states. [2019-12-19 04:34:20,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2502 to 2378. [2019-12-19 04:34:20,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2378 states. [2019-12-19 04:34:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2378 states to 2378 states and 5596 transitions. [2019-12-19 04:34:20,159 INFO L78 Accepts]: Start accepts. Automaton has 2378 states and 5596 transitions. Word has length 95 [2019-12-19 04:34:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 04:34:20,159 INFO L462 AbstractCegarLoop]: Abstraction has 2378 states and 5596 transitions. [2019-12-19 04:34:20,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-19 04:34:20,159 INFO L276 IsEmpty]: Start isEmpty. Operand 2378 states and 5596 transitions. [2019-12-19 04:34:20,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 04:34:20,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 04:34:20,162 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-19 04:34:20,162 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 04:34:20,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 04:34:20,162 INFO L82 PathProgramCache]: Analyzing trace with hash 331051299, now seen corresponding path program 3 times [2019-12-19 04:34:20,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 04:34:20,162 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049681967] [2019-12-19 04:34:20,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 04:34:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:34:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 04:34:20,243 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 04:34:20,244 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 04:34:20,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 04:34:20 BasicIcfg [2019-12-19 04:34:20,433 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 04:34:20,439 INFO L168 Benchmark]: Toolchain (without parser) took 68102.79 ms. Allocated memory was 146.3 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 102.3 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-19 04:34:20,440 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 04:34:20,440 INFO L168 Benchmark]: CACSL2BoogieTranslator took 701.22 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 156.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:20,441 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.15 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:20,441 INFO L168 Benchmark]: Boogie Preprocessor took 34.08 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:20,441 INFO L168 Benchmark]: RCFGBuilder took 813.40 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 107.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-12-19 04:34:20,442 INFO L168 Benchmark]: TraceAbstraction took 66467.82 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 106.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-19 04:34:20,444 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 701.22 ms. Allocated memory was 146.3 MB in the beginning and 203.9 MB in the end (delta: 57.7 MB). Free memory was 101.9 MB in the beginning and 156.7 MB in the end (delta: -54.8 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.15 ms. Allocated memory is still 203.9 MB. Free memory was 156.7 MB in the beginning and 153.3 MB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 34.08 ms. Allocated memory is still 203.9 MB. Free memory was 153.3 MB in the beginning and 151.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 813.40 ms. Allocated memory is still 203.9 MB. Free memory was 151.3 MB in the beginning and 107.1 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 66467.82 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 106.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.7 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] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L778] 0 pthread_t t2013; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L779] FCALL, FORK 0 pthread_create(&t2013, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L780] 0 pthread_t t2014; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L781] FCALL, FORK 0 pthread_create(&t2014, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 2 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 __unbuffered_p1_EAX = x [L753] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 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) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L756] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=2] [L756] 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) [L738] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 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 [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 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 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L758] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 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 [L759] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L760] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 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 [L763] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L783] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L787] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L788] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L788] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L789] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L789] 0 y$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 [L790] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L791] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] 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 [L794] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L795] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L796] 0 y$flush_delayed = weak$$choice2 [L797] 0 y$mem_tmp = y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 y = !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) [L799] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L799] 0 y$w_buff0 = 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)) [L800] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y$w_buff1 = 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)) [L801] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$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)) [L802] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y$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)) [L803] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 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)) [L804] 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, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$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)) [L805] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] EXPR 0 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y = y$flush_delayed ? y$mem_tmp : y [L807] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, 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=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 66.1s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 23.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8728 SDtfs, 9560 SDslu, 21766 SDs, 0 SdLazy, 9387 SolverSat, 670 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 410 GetRequests, 102 SyntacticMatches, 23 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 537 ImplicationChecksByTransitivity, 2.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84350occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.1s AutomataMinimizationTime, 35 MinimizatonAttempts, 128357 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 2819 NumberOfCodeBlocks, 2819 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2689 ConstructedInterpolants, 0 QuantifiedInterpolants, 518753 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...