/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/mix009_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 09:35:51,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 09:35:51,206 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 09:35:51,218 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 09:35:51,218 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 09:35:51,219 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 09:35:51,221 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 09:35:51,222 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 09:35:51,224 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 09:35:51,225 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 09:35:51,226 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 09:35:51,227 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 09:35:51,227 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 09:35:51,228 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 09:35:51,229 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 09:35:51,230 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 09:35:51,231 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 09:35:51,232 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 09:35:51,233 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 09:35:51,236 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 09:35:51,237 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 09:35:51,238 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 09:35:51,239 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 09:35:51,240 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 09:35:51,243 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 09:35:51,243 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 09:35:51,243 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 09:35:51,244 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 09:35:51,245 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 09:35:51,246 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 09:35:51,246 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 09:35:51,247 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 09:35:51,247 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 09:35:51,248 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 09:35:51,249 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 09:35:51,249 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 09:35:51,250 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 09:35:51,250 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 09:35:51,251 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 09:35:51,251 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 09:35:51,252 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 09:35:51,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-27 09:35:51,268 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 09:35:51,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 09:35:51,269 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 09:35:51,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 09:35:51,270 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 09:35:51,270 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 09:35:51,270 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 09:35:51,270 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 09:35:51,271 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 09:35:51,271 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 09:35:51,271 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 09:35:51,271 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 09:35:51,271 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 09:35:51,271 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 09:35:51,272 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 09:35:51,272 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 09:35:51,272 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 09:35:51,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 09:35:51,272 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 09:35:51,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 09:35:51,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 09:35:51,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 09:35:51,273 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 09:35:51,273 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 09:35:51,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 09:35:51,274 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 09:35:51,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 09:35:51,274 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-27 09:35:51,274 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 09:35:51,275 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 09:35:51,563 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 09:35:51,589 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 09:35:51,592 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 09:35:51,594 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 09:35:51,594 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 09:35:51,595 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-27 09:35:51,668 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79585b15c/fd9aea8e317a47b381c1599d8842a58c/FLAG21b78cf45 [2019-12-27 09:35:52,243 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 09:35:52,245 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_power.oepc.i [2019-12-27 09:35:52,259 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79585b15c/fd9aea8e317a47b381c1599d8842a58c/FLAG21b78cf45 [2019-12-27 09:35:52,516 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79585b15c/fd9aea8e317a47b381c1599d8842a58c [2019-12-27 09:35:52,526 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 09:35:52,528 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 09:35:52,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 09:35:52,530 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 09:35:52,535 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 09:35:52,536 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:35:52" (1/1) ... [2019-12-27 09:35:52,539 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@183e0aaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:52, skipping insertion in model container [2019-12-27 09:35:52,539 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:35:52" (1/1) ... [2019-12-27 09:35:52,547 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 09:35:52,607 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 09:35:53,068 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:35:53,081 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 09:35:53,195 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 09:35:53,275 INFO L208 MainTranslator]: Completed translation [2019-12-27 09:35:53,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53 WrapperNode [2019-12-27 09:35:53,275 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 09:35:53,276 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 09:35:53,276 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 09:35:53,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 09:35:53,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,306 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,339 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 09:35:53,339 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 09:35:53,339 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 09:35:53,339 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 09:35:53,348 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,348 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,353 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,354 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,366 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,371 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,375 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... [2019-12-27 09:35:53,380 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 09:35:53,381 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 09:35:53,381 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 09:35:53,381 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 09:35:53,382 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 09:35:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 09:35:53,443 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 09:35:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 09:35:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 09:35:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 09:35:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 09:35:53,444 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 09:35:53,444 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 09:35:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 09:35:53,445 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 09:35:53,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 09:35:53,447 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 09:35:54,130 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 09:35:54,130 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 09:35:54,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:35:54 BoogieIcfgContainer [2019-12-27 09:35:54,132 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 09:35:54,133 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 09:35:54,133 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 09:35:54,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 09:35:54,137 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:35:52" (1/3) ... [2019-12-27 09:35:54,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16979c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:35:54, skipping insertion in model container [2019-12-27 09:35:54,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:35:53" (2/3) ... [2019-12-27 09:35:54,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16979c31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:35:54, skipping insertion in model container [2019-12-27 09:35:54,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:35:54" (3/3) ... [2019-12-27 09:35:54,141 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_power.oepc.i [2019-12-27 09:35:54,152 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 09:35:54,153 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 09:35:54,161 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 09:35:54,162 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 09:35:54,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,206 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,206 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,213 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,214 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,215 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,216 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,216 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,217 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,224 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,226 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,265 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,266 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,267 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,267 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,268 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,268 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,271 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,272 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,273 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,274 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,274 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,277 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 09:35:54,294 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 09:35:54,315 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 09:35:54,315 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 09:35:54,316 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 09:35:54,316 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 09:35:54,316 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 09:35:54,316 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 09:35:54,316 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 09:35:54,316 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 09:35:54,332 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 184 transitions [2019-12-27 09:35:56,454 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32594 states. [2019-12-27 09:35:56,457 INFO L276 IsEmpty]: Start isEmpty. Operand 32594 states. [2019-12-27 09:35:56,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 09:35:56,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:35:56,467 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] [2019-12-27 09:35:56,468 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:35:56,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:35:56,475 INFO L82 PathProgramCache]: Analyzing trace with hash 1842126657, now seen corresponding path program 1 times [2019-12-27 09:35:56,485 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:35:56,485 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961740511] [2019-12-27 09:35:56,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:35:56,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:35:56,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:35:56,823 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961740511] [2019-12-27 09:35:56,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:35:56,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:35:56,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20131284] [2019-12-27 09:35:56,830 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:35:56,831 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:35:56,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:35:56,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:35:56,849 INFO L87 Difference]: Start difference. First operand 32594 states. Second operand 4 states. [2019-12-27 09:35:58,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:35:58,530 INFO L93 Difference]: Finished difference Result 33594 states and 129571 transitions. [2019-12-27 09:35:58,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:35:58,535 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2019-12-27 09:35:58,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:35:58,873 INFO L225 Difference]: With dead ends: 33594 [2019-12-27 09:35:58,873 INFO L226 Difference]: Without dead ends: 25706 [2019-12-27 09:35:58,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:35:59,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25706 states. [2019-12-27 09:36:00,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25706 to 25706. [2019-12-27 09:36:00,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25706 states. [2019-12-27 09:36:01,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25706 states to 25706 states and 99587 transitions. [2019-12-27 09:36:01,488 INFO L78 Accepts]: Start accepts. Automaton has 25706 states and 99587 transitions. Word has length 37 [2019-12-27 09:36:01,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:01,488 INFO L462 AbstractCegarLoop]: Abstraction has 25706 states and 99587 transitions. [2019-12-27 09:36:01,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:36:01,489 INFO L276 IsEmpty]: Start isEmpty. Operand 25706 states and 99587 transitions. [2019-12-27 09:36:01,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-27 09:36:01,497 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:01,498 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] [2019-12-27 09:36:01,498 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:01,499 INFO L82 PathProgramCache]: Analyzing trace with hash 994831418, now seen corresponding path program 1 times [2019-12-27 09:36:01,499 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:01,499 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330653440] [2019-12-27 09:36:01,499 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:01,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:01,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:01,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330653440] [2019-12-27 09:36:01,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:01,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:01,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767385363] [2019-12-27 09:36:01,617 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:01,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:01,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:01,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:01,618 INFO L87 Difference]: Start difference. First operand 25706 states and 99587 transitions. Second operand 5 states. [2019-12-27 09:36:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:02,854 INFO L93 Difference]: Finished difference Result 41084 states and 150434 transitions. [2019-12-27 09:36:02,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:02,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-27 09:36:02,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:03,041 INFO L225 Difference]: With dead ends: 41084 [2019-12-27 09:36:03,042 INFO L226 Difference]: Without dead ends: 40548 [2019-12-27 09:36:03,043 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:03,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40548 states. [2019-12-27 09:36:05,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40548 to 38928. [2019-12-27 09:36:05,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38928 states. [2019-12-27 09:36:05,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38928 states to 38928 states and 143584 transitions. [2019-12-27 09:36:05,692 INFO L78 Accepts]: Start accepts. Automaton has 38928 states and 143584 transitions. Word has length 49 [2019-12-27 09:36:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:05,694 INFO L462 AbstractCegarLoop]: Abstraction has 38928 states and 143584 transitions. [2019-12-27 09:36:05,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 38928 states and 143584 transitions. [2019-12-27 09:36:05,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-12-27 09:36:05,703 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:05,704 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] [2019-12-27 09:36:05,704 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:05,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:05,704 INFO L82 PathProgramCache]: Analyzing trace with hash -351997153, now seen corresponding path program 1 times [2019-12-27 09:36:05,705 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:05,705 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561446646] [2019-12-27 09:36:05,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:05,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:05,836 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561446646] [2019-12-27 09:36:05,836 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:05,836 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:05,837 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439820990] [2019-12-27 09:36:05,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:05,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:05,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:05,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:05,838 INFO L87 Difference]: Start difference. First operand 38928 states and 143584 transitions. Second operand 5 states. [2019-12-27 09:36:06,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:06,761 INFO L93 Difference]: Finished difference Result 49781 states and 180636 transitions. [2019-12-27 09:36:06,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:06,762 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2019-12-27 09:36:06,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:07,082 INFO L225 Difference]: With dead ends: 49781 [2019-12-27 09:36:07,082 INFO L226 Difference]: Without dead ends: 49277 [2019-12-27 09:36:07,082 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:07,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49277 states. [2019-12-27 09:36:09,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49277 to 42680. [2019-12-27 09:36:09,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42680 states. [2019-12-27 09:36:10,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42680 states to 42680 states and 156595 transitions. [2019-12-27 09:36:10,004 INFO L78 Accepts]: Start accepts. Automaton has 42680 states and 156595 transitions. Word has length 50 [2019-12-27 09:36:10,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:10,010 INFO L462 AbstractCegarLoop]: Abstraction has 42680 states and 156595 transitions. [2019-12-27 09:36:10,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:10,010 INFO L276 IsEmpty]: Start isEmpty. Operand 42680 states and 156595 transitions. [2019-12-27 09:36:10,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 09:36:10,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:10,028 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-27 09:36:10,028 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:10,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:10,029 INFO L82 PathProgramCache]: Analyzing trace with hash 2004382981, now seen corresponding path program 1 times [2019-12-27 09:36:10,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:10,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911324588] [2019-12-27 09:36:10,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:10,080 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:10,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911324588] [2019-12-27 09:36:10,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:10,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:36:10,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298909121] [2019-12-27 09:36:10,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:36:10,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:10,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:36:10,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:36:10,082 INFO L87 Difference]: Start difference. First operand 42680 states and 156595 transitions. Second operand 3 states. [2019-12-27 09:36:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:10,727 INFO L93 Difference]: Finished difference Result 61090 states and 221433 transitions. [2019-12-27 09:36:10,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:36:10,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 09:36:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:11,052 INFO L225 Difference]: With dead ends: 61090 [2019-12-27 09:36:11,053 INFO L226 Difference]: Without dead ends: 61090 [2019-12-27 09:36:11,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:36:11,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61090 states. [2019-12-27 09:36:13,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61090 to 48019. [2019-12-27 09:36:13,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48019 states. [2019-12-27 09:36:13,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48019 states to 48019 states and 174182 transitions. [2019-12-27 09:36:13,939 INFO L78 Accepts]: Start accepts. Automaton has 48019 states and 174182 transitions. Word has length 52 [2019-12-27 09:36:13,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:13,939 INFO L462 AbstractCegarLoop]: Abstraction has 48019 states and 174182 transitions. [2019-12-27 09:36:13,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:36:13,939 INFO L276 IsEmpty]: Start isEmpty. Operand 48019 states and 174182 transitions. [2019-12-27 09:36:13,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:36:13,958 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:13,958 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] [2019-12-27 09:36:13,958 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:13,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:13,959 INFO L82 PathProgramCache]: Analyzing trace with hash -189838484, now seen corresponding path program 1 times [2019-12-27 09:36:13,959 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:13,959 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595828716] [2019-12-27 09:36:13,959 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:13,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:14,134 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595828716] [2019-12-27 09:36:14,134 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:14,134 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:14,134 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159076456] [2019-12-27 09:36:14,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:14,135 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:14,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:14,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:14,136 INFO L87 Difference]: Start difference. First operand 48019 states and 174182 transitions. Second operand 6 states. [2019-12-27 09:36:15,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:15,115 INFO L93 Difference]: Finished difference Result 63759 states and 229382 transitions. [2019-12-27 09:36:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:15,116 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 09:36:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:15,727 INFO L225 Difference]: With dead ends: 63759 [2019-12-27 09:36:15,727 INFO L226 Difference]: Without dead ends: 63759 [2019-12-27 09:36:15,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:15,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63759 states. [2019-12-27 09:36:18,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63759 to 59952. [2019-12-27 09:36:18,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59952 states. [2019-12-27 09:36:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59952 states to 59952 states and 215675 transitions. [2019-12-27 09:36:18,932 INFO L78 Accepts]: Start accepts. Automaton has 59952 states and 215675 transitions. Word has length 56 [2019-12-27 09:36:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:18,932 INFO L462 AbstractCegarLoop]: Abstraction has 59952 states and 215675 transitions. [2019-12-27 09:36:18,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 59952 states and 215675 transitions. [2019-12-27 09:36:18,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:36:18,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:18,950 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] [2019-12-27 09:36:18,951 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:18,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1986789843, now seen corresponding path program 1 times [2019-12-27 09:36:18,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:18,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242602897] [2019-12-27 09:36:18,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:18,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:19,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242602897] [2019-12-27 09:36:19,061 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:19,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:36:19,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876771152] [2019-12-27 09:36:19,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:36:19,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:19,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:36:19,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:36:19,064 INFO L87 Difference]: Start difference. First operand 59952 states and 215675 transitions. Second operand 7 states. [2019-12-27 09:36:20,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:20,489 INFO L93 Difference]: Finished difference Result 83688 states and 290100 transitions. [2019-12-27 09:36:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:36:20,489 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 56 [2019-12-27 09:36:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:20,666 INFO L225 Difference]: With dead ends: 83688 [2019-12-27 09:36:20,666 INFO L226 Difference]: Without dead ends: 83688 [2019-12-27 09:36:20,667 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:36:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83688 states. [2019-12-27 09:36:24,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83688 to 71015. [2019-12-27 09:36:24,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71015 states. [2019-12-27 09:36:25,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71015 states to 71015 states and 249889 transitions. [2019-12-27 09:36:25,171 INFO L78 Accepts]: Start accepts. Automaton has 71015 states and 249889 transitions. Word has length 56 [2019-12-27 09:36:25,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:25,171 INFO L462 AbstractCegarLoop]: Abstraction has 71015 states and 249889 transitions. [2019-12-27 09:36:25,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:36:25,171 INFO L276 IsEmpty]: Start isEmpty. Operand 71015 states and 249889 transitions. [2019-12-27 09:36:25,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:36:25,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:25,184 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] [2019-12-27 09:36:25,185 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:25,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:25,185 INFO L82 PathProgramCache]: Analyzing trace with hash -1099286162, now seen corresponding path program 1 times [2019-12-27 09:36:25,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:25,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050673239] [2019-12-27 09:36:25,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:25,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:25,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:25,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050673239] [2019-12-27 09:36:25,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:25,279 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:36:25,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767905436] [2019-12-27 09:36:25,279 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:36:25,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:25,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:36:25,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:36:25,280 INFO L87 Difference]: Start difference. First operand 71015 states and 249889 transitions. Second operand 3 states. [2019-12-27 09:36:25,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:25,544 INFO L93 Difference]: Finished difference Result 54024 states and 188921 transitions. [2019-12-27 09:36:25,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:36:25,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-27 09:36:25,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:25,655 INFO L225 Difference]: With dead ends: 54024 [2019-12-27 09:36:25,655 INFO L226 Difference]: Without dead ends: 54024 [2019-12-27 09:36:25,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:36:25,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54024 states. [2019-12-27 09:36:26,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54024 to 53409. [2019-12-27 09:36:26,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53409 states. [2019-12-27 09:36:26,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53409 states to 53409 states and 187040 transitions. [2019-12-27 09:36:26,999 INFO L78 Accepts]: Start accepts. Automaton has 53409 states and 187040 transitions. Word has length 56 [2019-12-27 09:36:26,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:26,999 INFO L462 AbstractCegarLoop]: Abstraction has 53409 states and 187040 transitions. [2019-12-27 09:36:26,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:36:26,999 INFO L276 IsEmpty]: Start isEmpty. Operand 53409 states and 187040 transitions. [2019-12-27 09:36:27,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 09:36:27,008 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:27,008 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] [2019-12-27 09:36:27,008 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:27,009 INFO L82 PathProgramCache]: Analyzing trace with hash -541236016, now seen corresponding path program 1 times [2019-12-27 09:36:27,009 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:27,009 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729204309] [2019-12-27 09:36:27,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:27,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:27,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:27,116 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729204309] [2019-12-27 09:36:27,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:27,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:27,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360923788] [2019-12-27 09:36:27,117 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:27,118 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:27,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:27,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:27,118 INFO L87 Difference]: Start difference. First operand 53409 states and 187040 transitions. Second operand 6 states. [2019-12-27 09:36:27,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:27,907 INFO L93 Difference]: Finished difference Result 68649 states and 237304 transitions. [2019-12-27 09:36:27,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:36:27,907 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 56 [2019-12-27 09:36:27,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:28,048 INFO L225 Difference]: With dead ends: 68649 [2019-12-27 09:36:28,048 INFO L226 Difference]: Without dead ends: 68081 [2019-12-27 09:36:28,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-12-27 09:36:28,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68081 states. [2019-12-27 09:36:29,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68081 to 53493. [2019-12-27 09:36:29,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53493 states. [2019-12-27 09:36:29,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53493 states to 53493 states and 187737 transitions. [2019-12-27 09:36:29,798 INFO L78 Accepts]: Start accepts. Automaton has 53493 states and 187737 transitions. Word has length 56 [2019-12-27 09:36:29,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:29,798 INFO L462 AbstractCegarLoop]: Abstraction has 53493 states and 187737 transitions. [2019-12-27 09:36:29,798 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:29,798 INFO L276 IsEmpty]: Start isEmpty. Operand 53493 states and 187737 transitions. [2019-12-27 09:36:29,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 09:36:29,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:29,809 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] [2019-12-27 09:36:29,809 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:29,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:29,809 INFO L82 PathProgramCache]: Analyzing trace with hash -1873901397, now seen corresponding path program 1 times [2019-12-27 09:36:29,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:29,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1635853241] [2019-12-27 09:36:29,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:29,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-27 09:36:29,933 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1635853241] [2019-12-27 09:36:29,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:29,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:29,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195342558] [2019-12-27 09:36:29,934 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:29,935 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:29,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:29,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:29,935 INFO L87 Difference]: Start difference. First operand 53493 states and 187737 transitions. Second operand 5 states. [2019-12-27 09:36:30,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:30,398 INFO L93 Difference]: Finished difference Result 53613 states and 187581 transitions. [2019-12-27 09:36:30,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:36:30,398 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2019-12-27 09:36:30,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:30,507 INFO L225 Difference]: With dead ends: 53613 [2019-12-27 09:36:30,508 INFO L226 Difference]: Without dead ends: 53613 [2019-12-27 09:36:30,508 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:33,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53613 states. [2019-12-27 09:36:33,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53613 to 53526. [2019-12-27 09:36:33,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53526 states. [2019-12-27 09:36:33,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53526 states to 53526 states and 187311 transitions. [2019-12-27 09:36:33,783 INFO L78 Accepts]: Start accepts. Automaton has 53526 states and 187311 transitions. Word has length 57 [2019-12-27 09:36:33,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:33,783 INFO L462 AbstractCegarLoop]: Abstraction has 53526 states and 187311 transitions. [2019-12-27 09:36:33,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:33,784 INFO L276 IsEmpty]: Start isEmpty. Operand 53526 states and 187311 transitions. [2019-12-27 09:36:33,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 09:36:33,795 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:33,795 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] [2019-12-27 09:36:33,795 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:33,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:33,795 INFO L82 PathProgramCache]: Analyzing trace with hash -986397716, now seen corresponding path program 1 times [2019-12-27 09:36:33,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:33,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967078630] [2019-12-27 09:36:33,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:33,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:33,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:33,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967078630] [2019-12-27 09:36:33,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:33,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:36:33,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877088247] [2019-12-27 09:36:33,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:36:33,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:33,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:36:33,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:36:33,871 INFO L87 Difference]: Start difference. First operand 53526 states and 187311 transitions. Second operand 4 states. [2019-12-27 09:36:33,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:33,940 INFO L93 Difference]: Finished difference Result 10215 states and 31231 transitions. [2019-12-27 09:36:33,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:36:33,940 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-27 09:36:33,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:33,957 INFO L225 Difference]: With dead ends: 10215 [2019-12-27 09:36:33,958 INFO L226 Difference]: Without dead ends: 8510 [2019-12-27 09:36:33,958 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:33,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8510 states. [2019-12-27 09:36:34,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8510 to 8462. [2019-12-27 09:36:34,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8462 states. [2019-12-27 09:36:34,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8462 states to 8462 states and 25310 transitions. [2019-12-27 09:36:34,106 INFO L78 Accepts]: Start accepts. Automaton has 8462 states and 25310 transitions. Word has length 57 [2019-12-27 09:36:34,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:34,108 INFO L462 AbstractCegarLoop]: Abstraction has 8462 states and 25310 transitions. [2019-12-27 09:36:34,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:36:34,108 INFO L276 IsEmpty]: Start isEmpty. Operand 8462 states and 25310 transitions. [2019-12-27 09:36:34,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 09:36:34,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:34,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] [2019-12-27 09:36:34,114 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:34,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:34,115 INFO L82 PathProgramCache]: Analyzing trace with hash 227053228, now seen corresponding path program 1 times [2019-12-27 09:36:34,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:34,115 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925513483] [2019-12-27 09:36:34,115 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:34,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:34,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:34,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925513483] [2019-12-27 09:36:34,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:34,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:36:34,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986784767] [2019-12-27 09:36:34,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:36:34,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:34,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:36:34,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:36:34,160 INFO L87 Difference]: Start difference. First operand 8462 states and 25310 transitions. Second operand 4 states. [2019-12-27 09:36:34,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:34,262 INFO L93 Difference]: Finished difference Result 9709 states and 29089 transitions. [2019-12-27 09:36:34,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 09:36:34,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-27 09:36:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:34,281 INFO L225 Difference]: With dead ends: 9709 [2019-12-27 09:36:34,281 INFO L226 Difference]: Without dead ends: 9709 [2019-12-27 09:36:34,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:34,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9709 states. [2019-12-27 09:36:34,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9709 to 8882. [2019-12-27 09:36:34,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8882 states. [2019-12-27 09:36:34,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8882 states to 8882 states and 26573 transitions. [2019-12-27 09:36:34,905 INFO L78 Accepts]: Start accepts. Automaton has 8882 states and 26573 transitions. Word has length 64 [2019-12-27 09:36:34,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:34,905 INFO L462 AbstractCegarLoop]: Abstraction has 8882 states and 26573 transitions. [2019-12-27 09:36:34,906 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:36:34,906 INFO L276 IsEmpty]: Start isEmpty. Operand 8882 states and 26573 transitions. [2019-12-27 09:36:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 09:36:34,916 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:34,916 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:34,916 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:34,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:34,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1969863563, now seen corresponding path program 1 times [2019-12-27 09:36:34,917 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:34,918 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587512729] [2019-12-27 09:36:34,918 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:35,033 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587512729] [2019-12-27 09:36:35,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:35,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:35,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887432688] [2019-12-27 09:36:35,034 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:35,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:35,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:35,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:35,035 INFO L87 Difference]: Start difference. First operand 8882 states and 26573 transitions. Second operand 6 states. [2019-12-27 09:36:35,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:35,497 INFO L93 Difference]: Finished difference Result 11198 states and 33042 transitions. [2019-12-27 09:36:35,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:36:35,497 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 64 [2019-12-27 09:36:35,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:35,517 INFO L225 Difference]: With dead ends: 11198 [2019-12-27 09:36:35,517 INFO L226 Difference]: Without dead ends: 11137 [2019-12-27 09:36:35,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:36:35,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11137 states. [2019-12-27 09:36:35,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11137 to 10413. [2019-12-27 09:36:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10413 states. [2019-12-27 09:36:35,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10413 states to 10413 states and 30918 transitions. [2019-12-27 09:36:35,717 INFO L78 Accepts]: Start accepts. Automaton has 10413 states and 30918 transitions. Word has length 64 [2019-12-27 09:36:35,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:35,718 INFO L462 AbstractCegarLoop]: Abstraction has 10413 states and 30918 transitions. [2019-12-27 09:36:35,718 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 10413 states and 30918 transitions. [2019-12-27 09:36:35,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 09:36:35,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:35,726 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:35,726 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:35,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:35,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1630047156, now seen corresponding path program 1 times [2019-12-27 09:36:35,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:35,727 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026934935] [2019-12-27 09:36:35,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:35,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:35,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026934935] [2019-12-27 09:36:35,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:35,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:35,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556106386] [2019-12-27 09:36:35,796 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:35,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:35,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:35,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:35,797 INFO L87 Difference]: Start difference. First operand 10413 states and 30918 transitions. Second operand 5 states. [2019-12-27 09:36:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:36,527 INFO L93 Difference]: Finished difference Result 23564 states and 70323 transitions. [2019-12-27 09:36:36,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:36:36,527 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-27 09:36:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:36,562 INFO L225 Difference]: With dead ends: 23564 [2019-12-27 09:36:36,562 INFO L226 Difference]: Without dead ends: 23564 [2019-12-27 09:36:36,562 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-27 09:36:36,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23564 states. [2019-12-27 09:36:36,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23564 to 12623. [2019-12-27 09:36:36,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12623 states. [2019-12-27 09:36:36,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12623 states to 12623 states and 37510 transitions. [2019-12-27 09:36:36,806 INFO L78 Accepts]: Start accepts. Automaton has 12623 states and 37510 transitions. Word has length 70 [2019-12-27 09:36:36,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:36,806 INFO L462 AbstractCegarLoop]: Abstraction has 12623 states and 37510 transitions. [2019-12-27 09:36:36,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:36,806 INFO L276 IsEmpty]: Start isEmpty. Operand 12623 states and 37510 transitions. [2019-12-27 09:36:36,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 09:36:36,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:36,813 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:36,813 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:36,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:36,814 INFO L82 PathProgramCache]: Analyzing trace with hash -166904203, now seen corresponding path program 1 times [2019-12-27 09:36:36,814 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:36,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510141891] [2019-12-27 09:36:36,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:36,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:36,877 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:36,877 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510141891] [2019-12-27 09:36:36,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:36,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:36:36,878 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257095285] [2019-12-27 09:36:36,878 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:36:36,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:36,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:36:36,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:36:36,879 INFO L87 Difference]: Start difference. First operand 12623 states and 37510 transitions. Second operand 4 states. [2019-12-27 09:36:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:37,216 INFO L93 Difference]: Finished difference Result 16661 states and 48900 transitions. [2019-12-27 09:36:37,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:36:37,216 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-12-27 09:36:37,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:37,244 INFO L225 Difference]: With dead ends: 16661 [2019-12-27 09:36:37,244 INFO L226 Difference]: Without dead ends: 16661 [2019-12-27 09:36:37,245 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:36:37,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16661 states. [2019-12-27 09:36:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16661 to 14390. [2019-12-27 09:36:37,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14390 states. [2019-12-27 09:36:37,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14390 states to 14390 states and 42416 transitions. [2019-12-27 09:36:37,436 INFO L78 Accepts]: Start accepts. Automaton has 14390 states and 42416 transitions. Word has length 70 [2019-12-27 09:36:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:37,437 INFO L462 AbstractCegarLoop]: Abstraction has 14390 states and 42416 transitions. [2019-12-27 09:36:37,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:36:37,437 INFO L276 IsEmpty]: Start isEmpty. Operand 14390 states and 42416 transitions. [2019-12-27 09:36:37,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 09:36:37,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:37,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:37,445 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:37,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:37,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1077860278, now seen corresponding path program 1 times [2019-12-27 09:36:37,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:37,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627634253] [2019-12-27 09:36:37,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:37,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:37,530 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627634253] [2019-12-27 09:36:37,530 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:37,530 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:37,530 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999936178] [2019-12-27 09:36:37,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:37,531 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:37,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:37,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:37,531 INFO L87 Difference]: Start difference. First operand 14390 states and 42416 transitions. Second operand 6 states. [2019-12-27 09:36:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:38,184 INFO L93 Difference]: Finished difference Result 15631 states and 45417 transitions. [2019-12-27 09:36:38,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:38,185 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-27 09:36:38,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:38,206 INFO L225 Difference]: With dead ends: 15631 [2019-12-27 09:36:38,206 INFO L226 Difference]: Without dead ends: 15631 [2019-12-27 09:36:38,206 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:38,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15631 states. [2019-12-27 09:36:38,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15631 to 15301. [2019-12-27 09:36:38,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15301 states. [2019-12-27 09:36:38,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15301 states to 15301 states and 44579 transitions. [2019-12-27 09:36:38,715 INFO L78 Accepts]: Start accepts. Automaton has 15301 states and 44579 transitions. Word has length 70 [2019-12-27 09:36:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:38,715 INFO L462 AbstractCegarLoop]: Abstraction has 15301 states and 44579 transitions. [2019-12-27 09:36:38,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15301 states and 44579 transitions. [2019-12-27 09:36:38,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 09:36:38,725 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:38,725 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:38,725 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:38,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:38,726 INFO L82 PathProgramCache]: Analyzing trace with hash -999349065, now seen corresponding path program 1 times [2019-12-27 09:36:38,726 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:38,726 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590054943] [2019-12-27 09:36:38,726 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:38,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:38,805 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590054943] [2019-12-27 09:36:38,807 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:38,808 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:38,808 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160923611] [2019-12-27 09:36:38,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:38,809 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:38,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:38,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:38,809 INFO L87 Difference]: Start difference. First operand 15301 states and 44579 transitions. Second operand 6 states. [2019-12-27 09:36:39,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:39,321 INFO L93 Difference]: Finished difference Result 17459 states and 49461 transitions. [2019-12-27 09:36:39,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:36:39,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-12-27 09:36:39,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:39,344 INFO L225 Difference]: With dead ends: 17459 [2019-12-27 09:36:39,344 INFO L226 Difference]: Without dead ends: 17459 [2019-12-27 09:36:39,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:36:39,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17459 states. [2019-12-27 09:36:39,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17459 to 15842. [2019-12-27 09:36:39,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15842 states. [2019-12-27 09:36:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15842 states to 15842 states and 45416 transitions. [2019-12-27 09:36:39,548 INFO L78 Accepts]: Start accepts. Automaton has 15842 states and 45416 transitions. Word has length 70 [2019-12-27 09:36:39,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:39,548 INFO L462 AbstractCegarLoop]: Abstraction has 15842 states and 45416 transitions. [2019-12-27 09:36:39,549 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:39,549 INFO L276 IsEmpty]: Start isEmpty. Operand 15842 states and 45416 transitions. [2019-12-27 09:36:39,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 09:36:39,557 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:39,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:39,557 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:39,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:39,557 INFO L82 PathProgramCache]: Analyzing trace with hash -787998152, now seen corresponding path program 1 times [2019-12-27 09:36:39,557 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:39,558 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532189256] [2019-12-27 09:36:39,558 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:39,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:39,676 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:39,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532189256] [2019-12-27 09:36:39,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:39,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:36:39,677 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431869634] [2019-12-27 09:36:39,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:36:39,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:39,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:36:39,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:36:39,679 INFO L87 Difference]: Start difference. First operand 15842 states and 45416 transitions. Second operand 7 states. [2019-12-27 09:36:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:40,276 INFO L93 Difference]: Finished difference Result 18414 states and 51438 transitions. [2019-12-27 09:36:40,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 09:36:40,276 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 70 [2019-12-27 09:36:40,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:40,300 INFO L225 Difference]: With dead ends: 18414 [2019-12-27 09:36:40,300 INFO L226 Difference]: Without dead ends: 18414 [2019-12-27 09:36:40,301 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:36:40,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18414 states. [2019-12-27 09:36:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18414 to 16245. [2019-12-27 09:36:40,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16245 states. [2019-12-27 09:36:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16245 states to 16245 states and 45209 transitions. [2019-12-27 09:36:40,509 INFO L78 Accepts]: Start accepts. Automaton has 16245 states and 45209 transitions. Word has length 70 [2019-12-27 09:36:40,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:40,510 INFO L462 AbstractCegarLoop]: Abstraction has 16245 states and 45209 transitions. [2019-12-27 09:36:40,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:36:40,510 INFO L276 IsEmpty]: Start isEmpty. Operand 16245 states and 45209 transitions. [2019-12-27 09:36:40,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 09:36:40,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:40,517 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:40,517 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:40,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:40,517 INFO L82 PathProgramCache]: Analyzing trace with hash 99505529, now seen corresponding path program 1 times [2019-12-27 09:36:40,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:40,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518543476] [2019-12-27 09:36:40,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:40,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:40,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:40,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518543476] [2019-12-27 09:36:40,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:40,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:40,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687213154] [2019-12-27 09:36:40,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:40,596 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:40,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:40,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:40,599 INFO L87 Difference]: Start difference. First operand 16245 states and 45209 transitions. Second operand 5 states. [2019-12-27 09:36:40,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:40,652 INFO L93 Difference]: Finished difference Result 5337 states and 12605 transitions. [2019-12-27 09:36:40,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:36:40,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 70 [2019-12-27 09:36:40,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:40,659 INFO L225 Difference]: With dead ends: 5337 [2019-12-27 09:36:40,659 INFO L226 Difference]: Without dead ends: 4650 [2019-12-27 09:36:40,659 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:36:40,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4650 states. [2019-12-27 09:36:40,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4650 to 4325. [2019-12-27 09:36:40,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4325 states. [2019-12-27 09:36:40,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4325 states to 4325 states and 9952 transitions. [2019-12-27 09:36:40,701 INFO L78 Accepts]: Start accepts. Automaton has 4325 states and 9952 transitions. Word has length 70 [2019-12-27 09:36:40,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:40,701 INFO L462 AbstractCegarLoop]: Abstraction has 4325 states and 9952 transitions. [2019-12-27 09:36:40,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:40,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4325 states and 9952 transitions. [2019-12-27 09:36:40,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-12-27 09:36:40,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:40,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:40,706 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:40,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:40,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1027808388, now seen corresponding path program 1 times [2019-12-27 09:36:40,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:40,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046678292] [2019-12-27 09:36:40,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:40,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:40,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:40,733 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046678292] [2019-12-27 09:36:40,733 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:40,733 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 09:36:40,734 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440434102] [2019-12-27 09:36:40,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 09:36:40,734 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:40,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 09:36:40,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:36:40,735 INFO L87 Difference]: Start difference. First operand 4325 states and 9952 transitions. Second operand 3 states. [2019-12-27 09:36:40,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:40,783 INFO L93 Difference]: Finished difference Result 5345 states and 12117 transitions. [2019-12-27 09:36:40,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 09:36:40,784 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 70 [2019-12-27 09:36:40,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:40,791 INFO L225 Difference]: With dead ends: 5345 [2019-12-27 09:36:40,791 INFO L226 Difference]: Without dead ends: 5345 [2019-12-27 09:36:40,792 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 09:36:40,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5345 states. [2019-12-27 09:36:40,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5345 to 4260. [2019-12-27 09:36:40,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4260 states. [2019-12-27 09:36:40,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4260 states to 4260 states and 9560 transitions. [2019-12-27 09:36:40,857 INFO L78 Accepts]: Start accepts. Automaton has 4260 states and 9560 transitions. Word has length 70 [2019-12-27 09:36:40,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:40,857 INFO L462 AbstractCegarLoop]: Abstraction has 4260 states and 9560 transitions. [2019-12-27 09:36:40,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 09:36:40,857 INFO L276 IsEmpty]: Start isEmpty. Operand 4260 states and 9560 transitions. [2019-12-27 09:36:40,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 09:36:40,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:40,863 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] [2019-12-27 09:36:40,863 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:40,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:40,863 INFO L82 PathProgramCache]: Analyzing trace with hash -812209841, now seen corresponding path program 1 times [2019-12-27 09:36:40,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:40,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900783542] [2019-12-27 09:36:40,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:40,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:40,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:40,935 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900783542] [2019-12-27 09:36:40,935 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:40,935 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:40,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567165475] [2019-12-27 09:36:40,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:40,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:40,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:40,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:40,938 INFO L87 Difference]: Start difference. First operand 4260 states and 9560 transitions. Second operand 5 states. [2019-12-27 09:36:41,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:41,108 INFO L93 Difference]: Finished difference Result 5299 states and 11944 transitions. [2019-12-27 09:36:41,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 09:36:41,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-12-27 09:36:41,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:41,115 INFO L225 Difference]: With dead ends: 5299 [2019-12-27 09:36:41,116 INFO L226 Difference]: Without dead ends: 5299 [2019-12-27 09:36:41,116 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 09:36:41,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5299 states. [2019-12-27 09:36:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5299 to 4888. [2019-12-27 09:36:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4888 states. [2019-12-27 09:36:41,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4888 states to 4888 states and 10968 transitions. [2019-12-27 09:36:41,164 INFO L78 Accepts]: Start accepts. Automaton has 4888 states and 10968 transitions. Word has length 76 [2019-12-27 09:36:41,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:41,164 INFO L462 AbstractCegarLoop]: Abstraction has 4888 states and 10968 transitions. [2019-12-27 09:36:41,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:41,164 INFO L276 IsEmpty]: Start isEmpty. Operand 4888 states and 10968 transitions. [2019-12-27 09:36:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-27 09:36:41,168 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:41,168 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] [2019-12-27 09:36:41,168 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:41,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:41,169 INFO L82 PathProgramCache]: Analyzing trace with hash 930600494, now seen corresponding path program 1 times [2019-12-27 09:36:41,169 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:41,169 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26495092] [2019-12-27 09:36:41,169 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:41,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:41,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:41,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26495092] [2019-12-27 09:36:41,228 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:41,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:36:41,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607301400] [2019-12-27 09:36:41,228 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:36:41,229 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:41,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:36:41,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:36:41,229 INFO L87 Difference]: Start difference. First operand 4888 states and 10968 transitions. Second operand 7 states. [2019-12-27 09:36:41,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:41,976 INFO L93 Difference]: Finished difference Result 5520 states and 12289 transitions. [2019-12-27 09:36:41,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 09:36:41,976 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 76 [2019-12-27 09:36:41,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:41,984 INFO L225 Difference]: With dead ends: 5520 [2019-12-27 09:36:41,984 INFO L226 Difference]: Without dead ends: 5467 [2019-12-27 09:36:41,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-27 09:36:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5467 states. [2019-12-27 09:36:42,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5467 to 4912. [2019-12-27 09:36:42,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4912 states. [2019-12-27 09:36:42,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4912 states to 4912 states and 10945 transitions. [2019-12-27 09:36:42,035 INFO L78 Accepts]: Start accepts. Automaton has 4912 states and 10945 transitions. Word has length 76 [2019-12-27 09:36:42,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:42,035 INFO L462 AbstractCegarLoop]: Abstraction has 4912 states and 10945 transitions. [2019-12-27 09:36:42,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:36:42,035 INFO L276 IsEmpty]: Start isEmpty. Operand 4912 states and 10945 transitions. [2019-12-27 09:36:42,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-27 09:36:42,040 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:42,040 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:42,040 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:42,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:42,041 INFO L82 PathProgramCache]: Analyzing trace with hash 513999619, now seen corresponding path program 1 times [2019-12-27 09:36:42,041 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:42,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484704964] [2019-12-27 09:36:42,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:42,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:42,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:42,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484704964] [2019-12-27 09:36:42,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:42,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 09:36:42,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862546802] [2019-12-27 09:36:42,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 09:36:42,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:42,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 09:36:42,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 09:36:42,115 INFO L87 Difference]: Start difference. First operand 4912 states and 10945 transitions. Second operand 4 states. [2019-12-27 09:36:42,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:42,223 INFO L93 Difference]: Finished difference Result 5854 states and 12960 transitions. [2019-12-27 09:36:42,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 09:36:42,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-12-27 09:36:42,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:42,232 INFO L225 Difference]: With dead ends: 5854 [2019-12-27 09:36:42,233 INFO L226 Difference]: Without dead ends: 5854 [2019-12-27 09:36:42,233 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-27 09:36:42,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5854 states. [2019-12-27 09:36:42,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5854 to 5244. [2019-12-27 09:36:42,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5244 states. [2019-12-27 09:36:42,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 11647 transitions. [2019-12-27 09:36:42,320 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 11647 transitions. Word has length 97 [2019-12-27 09:36:42,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:42,321 INFO L462 AbstractCegarLoop]: Abstraction has 5244 states and 11647 transitions. [2019-12-27 09:36:42,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 09:36:42,321 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 11647 transitions. [2019-12-27 09:36:42,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:42,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:42,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:42,328 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:42,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:42,329 INFO L82 PathProgramCache]: Analyzing trace with hash -1028011755, now seen corresponding path program 1 times [2019-12-27 09:36:42,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:42,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579629230] [2019-12-27 09:36:42,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:42,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:42,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:42,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579629230] [2019-12-27 09:36:42,403 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:42,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:42,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478956864] [2019-12-27 09:36:42,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:42,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:42,404 INFO L87 Difference]: Start difference. First operand 5244 states and 11647 transitions. Second operand 6 states. [2019-12-27 09:36:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:43,081 INFO L93 Difference]: Finished difference Result 7912 states and 17668 transitions. [2019-12-27 09:36:43,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 09:36:43,082 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-27 09:36:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:43,092 INFO L225 Difference]: With dead ends: 7912 [2019-12-27 09:36:43,092 INFO L226 Difference]: Without dead ends: 7912 [2019-12-27 09:36:43,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-27 09:36:43,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7912 states. [2019-12-27 09:36:43,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7912 to 6039. [2019-12-27 09:36:43,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6039 states. [2019-12-27 09:36:43,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6039 states to 6039 states and 13543 transitions. [2019-12-27 09:36:43,164 INFO L78 Accepts]: Start accepts. Automaton has 6039 states and 13543 transitions. Word has length 99 [2019-12-27 09:36:43,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:43,164 INFO L462 AbstractCegarLoop]: Abstraction has 6039 states and 13543 transitions. [2019-12-27 09:36:43,164 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:43,164 INFO L276 IsEmpty]: Start isEmpty. Operand 6039 states and 13543 transitions. [2019-12-27 09:36:43,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:43,170 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:43,170 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:43,170 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:43,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:43,170 INFO L82 PathProgramCache]: Analyzing trace with hash -1016695628, now seen corresponding path program 1 times [2019-12-27 09:36:43,170 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:43,171 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142304117] [2019-12-27 09:36:43,171 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:43,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:43,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:43,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142304117] [2019-12-27 09:36:43,265 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:43,265 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 09:36:43,265 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169030346] [2019-12-27 09:36:43,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 09:36:43,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:43,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 09:36:43,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:36:43,267 INFO L87 Difference]: Start difference. First operand 6039 states and 13543 transitions. Second operand 7 states. [2019-12-27 09:36:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:44,490 INFO L93 Difference]: Finished difference Result 8510 states and 18883 transitions. [2019-12-27 09:36:44,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 09:36:44,491 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 99 [2019-12-27 09:36:44,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:44,501 INFO L225 Difference]: With dead ends: 8510 [2019-12-27 09:36:44,501 INFO L226 Difference]: Without dead ends: 8430 [2019-12-27 09:36:44,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-12-27 09:36:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8430 states. [2019-12-27 09:36:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8430 to 7002. [2019-12-27 09:36:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7002 states. [2019-12-27 09:36:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7002 states to 7002 states and 15651 transitions. [2019-12-27 09:36:44,579 INFO L78 Accepts]: Start accepts. Automaton has 7002 states and 15651 transitions. Word has length 99 [2019-12-27 09:36:44,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:44,580 INFO L462 AbstractCegarLoop]: Abstraction has 7002 states and 15651 transitions. [2019-12-27 09:36:44,580 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 09:36:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 7002 states and 15651 transitions. [2019-12-27 09:36:44,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:44,588 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:44,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:44,589 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1201062325, now seen corresponding path program 1 times [2019-12-27 09:36:44,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:44,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674460745] [2019-12-27 09:36:44,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:44,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:44,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:44,714 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674460745] [2019-12-27 09:36:44,714 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:44,714 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:44,714 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547562905] [2019-12-27 09:36:44,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:44,715 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:44,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:44,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:44,715 INFO L87 Difference]: Start difference. First operand 7002 states and 15651 transitions. Second operand 6 states. [2019-12-27 09:36:44,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:44,961 INFO L93 Difference]: Finished difference Result 6225 states and 13653 transitions. [2019-12-27 09:36:44,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:36:44,961 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-27 09:36:44,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:44,968 INFO L225 Difference]: With dead ends: 6225 [2019-12-27 09:36:44,968 INFO L226 Difference]: Without dead ends: 6189 [2019-12-27 09:36:44,969 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-27 09:36:44,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6189 states. [2019-12-27 09:36:45,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6189 to 5424. [2019-12-27 09:36:45,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5424 states. [2019-12-27 09:36:45,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5424 states to 5424 states and 11934 transitions. [2019-12-27 09:36:45,025 INFO L78 Accepts]: Start accepts. Automaton has 5424 states and 11934 transitions. Word has length 99 [2019-12-27 09:36:45,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:45,026 INFO L462 AbstractCegarLoop]: Abstraction has 5424 states and 11934 transitions. [2019-12-27 09:36:45,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:45,026 INFO L276 IsEmpty]: Start isEmpty. Operand 5424 states and 11934 transitions. [2019-12-27 09:36:45,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:45,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:45,034 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:45,034 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:45,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:45,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1192417937, now seen corresponding path program 1 times [2019-12-27 09:36:45,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:45,035 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505936798] [2019-12-27 09:36:45,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:45,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:45,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505936798] [2019-12-27 09:36:45,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:45,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:45,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906647404] [2019-12-27 09:36:45,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:45,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:45,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:45,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:45,104 INFO L87 Difference]: Start difference. First operand 5424 states and 11934 transitions. Second operand 5 states. [2019-12-27 09:36:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:45,229 INFO L93 Difference]: Finished difference Result 5914 states and 12996 transitions. [2019-12-27 09:36:45,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 09:36:45,230 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-27 09:36:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:45,238 INFO L225 Difference]: With dead ends: 5914 [2019-12-27 09:36:45,238 INFO L226 Difference]: Without dead ends: 5914 [2019-12-27 09:36:45,238 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 09:36:45,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5914 states. [2019-12-27 09:36:45,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5914 to 4663. [2019-12-27 09:36:45,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4663 states. [2019-12-27 09:36:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4663 states to 4663 states and 10258 transitions. [2019-12-27 09:36:45,294 INFO L78 Accepts]: Start accepts. Automaton has 4663 states and 10258 transitions. Word has length 99 [2019-12-27 09:36:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:45,294 INFO L462 AbstractCegarLoop]: Abstraction has 4663 states and 10258 transitions. [2019-12-27 09:36:45,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 4663 states and 10258 transitions. [2019-12-27 09:36:45,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:45,299 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:45,299 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:45,299 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:45,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:45,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2077057360, now seen corresponding path program 1 times [2019-12-27 09:36:45,300 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:45,300 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140583103] [2019-12-27 09:36:45,300 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:45,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:45,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:45,396 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140583103] [2019-12-27 09:36:45,396 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:45,396 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:45,396 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605266841] [2019-12-27 09:36:45,397 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:45,397 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:45,397 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:45,397 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:45,397 INFO L87 Difference]: Start difference. First operand 4663 states and 10258 transitions. Second operand 5 states. [2019-12-27 09:36:45,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:45,983 INFO L93 Difference]: Finished difference Result 5588 states and 12229 transitions. [2019-12-27 09:36:45,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 09:36:45,984 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-27 09:36:45,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:45,992 INFO L225 Difference]: With dead ends: 5588 [2019-12-27 09:36:45,992 INFO L226 Difference]: Without dead ends: 5528 [2019-12-27 09:36:45,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:46,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5528 states. [2019-12-27 09:36:46,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5528 to 5222. [2019-12-27 09:36:46,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5222 states. [2019-12-27 09:36:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 11466 transitions. [2019-12-27 09:36:46,073 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 11466 transitions. Word has length 99 [2019-12-27 09:36:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:46,073 INFO L462 AbstractCegarLoop]: Abstraction has 5222 states and 11466 transitions. [2019-12-27 09:36:46,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 11466 transitions. [2019-12-27 09:36:46,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:46,079 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:46,080 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:46,080 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:46,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:46,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1963173391, now seen corresponding path program 1 times [2019-12-27 09:36:46,080 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:46,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835157027] [2019-12-27 09:36:46,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:46,138 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:46,138 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835157027] [2019-12-27 09:36:46,138 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:46,139 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 09:36:46,139 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516665370] [2019-12-27 09:36:46,139 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 09:36:46,139 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:46,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 09:36:46,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 09:36:46,140 INFO L87 Difference]: Start difference. First operand 5222 states and 11466 transitions. Second operand 5 states. [2019-12-27 09:36:46,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:46,384 INFO L93 Difference]: Finished difference Result 6154 states and 13387 transitions. [2019-12-27 09:36:46,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:46,385 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-12-27 09:36:46,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:46,392 INFO L225 Difference]: With dead ends: 6154 [2019-12-27 09:36:46,392 INFO L226 Difference]: Without dead ends: 6096 [2019-12-27 09:36:46,393 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:46,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6096 states. [2019-12-27 09:36:46,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6096 to 4963. [2019-12-27 09:36:46,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4963 states. [2019-12-27 09:36:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4963 states to 4963 states and 10944 transitions. [2019-12-27 09:36:46,701 INFO L78 Accepts]: Start accepts. Automaton has 4963 states and 10944 transitions. Word has length 99 [2019-12-27 09:36:46,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:46,701 INFO L462 AbstractCegarLoop]: Abstraction has 4963 states and 10944 transitions. [2019-12-27 09:36:46,702 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 09:36:46,702 INFO L276 IsEmpty]: Start isEmpty. Operand 4963 states and 10944 transitions. [2019-12-27 09:36:46,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:46,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:46,706 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:46,706 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:46,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:46,707 INFO L82 PathProgramCache]: Analyzing trace with hash 579065745, now seen corresponding path program 2 times [2019-12-27 09:36:46,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:46,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124620158] [2019-12-27 09:36:46,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:46,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:46,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124620158] [2019-12-27 09:36:46,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:46,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 09:36:46,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199693715] [2019-12-27 09:36:46,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 09:36:46,798 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 09:36:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 09:36:46,799 INFO L87 Difference]: Start difference. First operand 4963 states and 10944 transitions. Second operand 6 states. [2019-12-27 09:36:47,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:47,056 INFO L93 Difference]: Finished difference Result 5219 states and 11466 transitions. [2019-12-27 09:36:47,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:47,056 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 99 [2019-12-27 09:36:47,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:47,063 INFO L225 Difference]: With dead ends: 5219 [2019-12-27 09:36:47,064 INFO L226 Difference]: Without dead ends: 5219 [2019-12-27 09:36:47,066 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:47,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2019-12-27 09:36:47,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 4905. [2019-12-27 09:36:47,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4905 states. [2019-12-27 09:36:47,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4905 states to 4905 states and 10818 transitions. [2019-12-27 09:36:47,145 INFO L78 Accepts]: Start accepts. Automaton has 4905 states and 10818 transitions. Word has length 99 [2019-12-27 09:36:47,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:47,145 INFO L462 AbstractCegarLoop]: Abstraction has 4905 states and 10818 transitions. [2019-12-27 09:36:47,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 09:36:47,146 INFO L276 IsEmpty]: Start isEmpty. Operand 4905 states and 10818 transitions. [2019-12-27 09:36:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:47,151 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:47,152 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:47,152 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:47,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:47,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1461100972, now seen corresponding path program 1 times [2019-12-27 09:36:47,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:47,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031692173] [2019-12-27 09:36:47,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:47,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:47,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:47,305 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031692173] [2019-12-27 09:36:47,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:47,306 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:36:47,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300665402] [2019-12-27 09:36:47,306 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:36:47,306 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:47,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:36:47,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:47,307 INFO L87 Difference]: Start difference. First operand 4905 states and 10818 transitions. Second operand 8 states. [2019-12-27 09:36:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:47,747 INFO L93 Difference]: Finished difference Result 5693 states and 12426 transitions. [2019-12-27 09:36:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 09:36:47,748 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-12-27 09:36:47,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:47,756 INFO L225 Difference]: With dead ends: 5693 [2019-12-27 09:36:47,756 INFO L226 Difference]: Without dead ends: 5693 [2019-12-27 09:36:47,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2019-12-27 09:36:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5693 states. [2019-12-27 09:36:47,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5693 to 5213. [2019-12-27 09:36:47,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5213 states. [2019-12-27 09:36:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5213 states to 5213 states and 11437 transitions. [2019-12-27 09:36:47,838 INFO L78 Accepts]: Start accepts. Automaton has 5213 states and 11437 transitions. Word has length 99 [2019-12-27 09:36:47,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:47,839 INFO L462 AbstractCegarLoop]: Abstraction has 5213 states and 11437 transitions. [2019-12-27 09:36:47,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:36:47,839 INFO L276 IsEmpty]: Start isEmpty. Operand 5213 states and 11437 transitions. [2019-12-27 09:36:47,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:47,846 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:47,846 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:47,846 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:47,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:47,846 INFO L82 PathProgramCache]: Analyzing trace with hash -573597291, now seen corresponding path program 1 times [2019-12-27 09:36:47,847 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:47,847 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608214512] [2019-12-27 09:36:47,847 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:47,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 09:36:47,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 09:36:47,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608214512] [2019-12-27 09:36:47,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 09:36:47,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 09:36:47,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9713571] [2019-12-27 09:36:47,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 09:36:47,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 09:36:47,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 09:36:47,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 09:36:47,999 INFO L87 Difference]: Start difference. First operand 5213 states and 11437 transitions. Second operand 8 states. [2019-12-27 09:36:48,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 09:36:48,106 INFO L93 Difference]: Finished difference Result 8304 states and 18320 transitions. [2019-12-27 09:36:48,106 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 09:36:48,106 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 99 [2019-12-27 09:36:48,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 09:36:48,111 INFO L225 Difference]: With dead ends: 8304 [2019-12-27 09:36:48,111 INFO L226 Difference]: Without dead ends: 3273 [2019-12-27 09:36:48,112 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-12-27 09:36:48,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3273 states. [2019-12-27 09:36:48,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3273 to 3273. [2019-12-27 09:36:48,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3273 states. [2019-12-27 09:36:48,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3273 states to 3273 states and 7226 transitions. [2019-12-27 09:36:48,144 INFO L78 Accepts]: Start accepts. Automaton has 3273 states and 7226 transitions. Word has length 99 [2019-12-27 09:36:48,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 09:36:48,144 INFO L462 AbstractCegarLoop]: Abstraction has 3273 states and 7226 transitions. [2019-12-27 09:36:48,144 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 09:36:48,144 INFO L276 IsEmpty]: Start isEmpty. Operand 3273 states and 7226 transitions. [2019-12-27 09:36:48,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-12-27 09:36:48,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 09:36:48,147 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 09:36:48,147 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 09:36:48,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 09:36:48,147 INFO L82 PathProgramCache]: Analyzing trace with hash 790630937, now seen corresponding path program 2 times [2019-12-27 09:36:48,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 09:36:48,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099134258] [2019-12-27 09:36:48,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 09:36:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:36:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 09:36:48,267 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 09:36:48,268 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 09:36:48,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:36:48 BasicIcfg [2019-12-27 09:36:48,481 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 09:36:48,488 INFO L168 Benchmark]: Toolchain (without parser) took 55955.05 ms. Allocated memory was 145.2 MB in the beginning and 2.5 GB in the end (delta: 2.4 GB). Free memory was 100.3 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 998.9 MB. Max. memory is 7.1 GB. [2019-12-27 09:36:48,489 INFO L168 Benchmark]: CDTParser took 1.63 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 09:36:48,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 746.43 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 156.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. [2019-12-27 09:36:48,490 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 09:36:48,490 INFO L168 Benchmark]: Boogie Preprocessor took 41.58 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 09:36:48,491 INFO L168 Benchmark]: RCFGBuilder took 750.91 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 107.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 09:36:48,491 INFO L168 Benchmark]: TraceAbstraction took 54347.67 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 947.9 MB. Max. memory is 7.1 GB. [2019-12-27 09:36:48,494 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.63 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 746.43 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 100.1 MB in the beginning and 156.6 MB in the end (delta: -56.5 MB). Peak memory consumption was 20.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.45 ms. Allocated memory is still 202.4 MB. Free memory was 156.6 MB in the beginning and 154.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.58 ms. Allocated memory is still 202.4 MB. Free memory was 154.0 MB in the beginning and 151.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 750.91 ms. Allocated memory is still 202.4 MB. Free memory was 151.4 MB in the beginning and 107.1 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 54347.67 ms. Allocated memory was 202.4 MB in the beginning and 2.5 GB in the end (delta: 2.3 GB). Free memory was 106.4 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 947.9 MB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p0_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0] [L700] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0] [L702] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L703] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L704] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L706] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L708] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L710] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L711] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L712] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L713] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L714] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L715] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L716] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L717] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L718] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L719] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L720] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L721] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L722] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L723] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L724] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L725] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L726] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 pthread_t t241; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L809] FCALL, FORK 0 pthread_create(&t241, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L810] 0 pthread_t t242; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t242, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L735] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L736] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L737] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L738] 1 z$r_buff0_thd1 = (_Bool)1 [L741] 1 x = 1 [L744] 1 __unbuffered_p0_EAX = x [L747] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L779] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L780] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L753] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L753] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L754] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L754] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L757] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z = z$flush_delayed ? z$mem_tmp : z [L783] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L789] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L790] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L818] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L821] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L821] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L824] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 53.9s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 19.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8604 SDtfs, 10740 SDslu, 17556 SDs, 0 SdLazy, 7169 SolverSat, 573 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 81 SyntacticMatches, 21 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71015occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 28.5s AutomataMinimizationTime, 31 MinimizatonAttempts, 82521 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2383 NumberOfCodeBlocks, 2383 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2253 ConstructedInterpolants, 0 QuantifiedInterpolants, 491203 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...