/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:46:59,289 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:46:59,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:46:59,310 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:46:59,311 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:46:59,315 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:46:59,317 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:46:59,330 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:46:59,332 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:46:59,333 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:46:59,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:46:59,337 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:46:59,337 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:46:59,339 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:46:59,342 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:46:59,344 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:46:59,345 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:46:59,348 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:46:59,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:46:59,354 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:46:59,356 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:46:59,357 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:46:59,358 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:46:59,359 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:46:59,361 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:46:59,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:46:59,363 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:46:59,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:46:59,367 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:46:59,368 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:46:59,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:46:59,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:46:59,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:46:59,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:46:59,374 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:46:59,375 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:46:59,376 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:46:59,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:46:59,377 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:46:59,378 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:46:59,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:46:59,381 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-MCR.epf [2019-12-28 03:46:59,402 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:46:59,402 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:46:59,403 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:46:59,403 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:46:59,404 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:46:59,404 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:46:59,404 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:46:59,404 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:46:59,404 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:46:59,405 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:46:59,405 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:46:59,405 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:46:59,405 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:46:59,405 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:46:59,405 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:46:59,406 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:46:59,406 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:46:59,406 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:46:59,406 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:46:59,406 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:46:59,407 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:46:59,407 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:46:59,407 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:46:59,407 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:46:59,407 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:46:59,408 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:46:59,408 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:46:59,408 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:46:59,408 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:46:59,408 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:46:59,409 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:46:59,409 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:46:59,721 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:46:59,741 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:46:59,745 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:46:59,747 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:46:59,748 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:46:59,749 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i [2019-12-28 03:46:59,821 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecbd9bd3a/efc44c35d8964b7a8c460a7f487475dc/FLAG5696ab95e [2019-12-28 03:47:00,439 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:47:00,441 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_rmo.opt.i [2019-12-28 03:47:00,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecbd9bd3a/efc44c35d8964b7a8c460a7f487475dc/FLAG5696ab95e [2019-12-28 03:47:00,709 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ecbd9bd3a/efc44c35d8964b7a8c460a7f487475dc [2019-12-28 03:47:00,720 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:47:00,722 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:47:00,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:47:00,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:47:00,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:47:00,728 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:47:00" (1/1) ... [2019-12-28 03:47:00,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6724b7e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:00, skipping insertion in model container [2019-12-28 03:47:00,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:47:00" (1/1) ... [2019-12-28 03:47:00,739 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:47:00,798 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:47:01,317 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:47:01,329 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:47:01,397 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:47:01,471 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:47:01,472 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01 WrapperNode [2019-12-28 03:47:01,472 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:47:01,473 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:47:01,473 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:47:01,473 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:47:01,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,502 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:47:01,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:47:01,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:47:01,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:47:01,541 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,546 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,546 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,558 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,566 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,571 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (1/1) ... [2019-12-28 03:47:01,578 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:47:01,578 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:47:01,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:47:01,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:47:01,580 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (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-28 03:47:01,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:47:01,636 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:47:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:47:01,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:47:01,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:47:01,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:47:01,640 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:47:02,284 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:47:02,285 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:47:02,286 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:47:02 BoogieIcfgContainer [2019-12-28 03:47:02,286 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:47:02,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:47:02,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:47:02,291 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:47:02,291 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:47:00" (1/3) ... [2019-12-28 03:47:02,292 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60585a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:47:02, skipping insertion in model container [2019-12-28 03:47:02,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:47:01" (2/3) ... [2019-12-28 03:47:02,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60585a99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:47:02, skipping insertion in model container [2019-12-28 03:47:02,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:47:02" (3/3) ... [2019-12-28 03:47:02,295 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_rmo.opt.i [2019-12-28 03:47:02,306 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:47:02,306 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:47:02,314 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:47:02,315 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:47:02,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,352 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,353 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,353 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,354 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,354 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,355 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,356 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,357 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,358 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,359 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,360 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,361 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,362 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,363 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,364 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,365 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,366 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,367 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,368 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,369 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,370 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,371 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,372 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,373 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,374 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,375 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,376 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,377 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,377 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,378 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,378 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,379 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,379 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,380 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,381 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,382 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,383 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,384 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,385 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,389 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,390 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,390 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,391 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,392 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,410 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,411 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,411 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,412 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,412 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,413 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,414 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,415 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:47:02,432 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:47:02,451 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:47:02,451 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:47:02,452 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:47:02,453 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:47:02,453 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:47:02,453 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:47:02,454 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:47:02,454 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:47:02,470 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 137 places, 165 transitions [2019-12-28 03:47:03,875 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 25977 states. [2019-12-28 03:47:03,877 INFO L276 IsEmpty]: Start isEmpty. Operand 25977 states. [2019-12-28 03:47:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-28 03:47:03,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:03,890 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] [2019-12-28 03:47:03,891 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:03,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash -503711198, now seen corresponding path program 1 times [2019-12-28 03:47:03,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:03,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063545376] [2019-12-28 03:47:03,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:04,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:04,216 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-28 03:47:04,216 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063545376] [2019-12-28 03:47:04,217 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:04,218 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:04,218 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1169927541] [2019-12-28 03:47:04,219 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:04,226 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:04,249 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 41 states and 40 transitions. [2019-12-28 03:47:04,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:04,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:04,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:04,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:04,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:04,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:04,271 INFO L87 Difference]: Start difference. First operand 25977 states. Second operand 4 states. [2019-12-28 03:47:05,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:05,015 INFO L93 Difference]: Finished difference Result 26617 states and 102122 transitions. [2019-12-28 03:47:05,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:47:05,017 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-28 03:47:05,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:05,229 INFO L225 Difference]: With dead ends: 26617 [2019-12-28 03:47:05,230 INFO L226 Difference]: Without dead ends: 20361 [2019-12-28 03:47:05,238 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-28 03:47:05,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20361 states. [2019-12-28 03:47:06,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20361 to 20361. [2019-12-28 03:47:06,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20361 states. [2019-12-28 03:47:07,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20361 states to 20361 states and 78426 transitions. [2019-12-28 03:47:07,054 INFO L78 Accepts]: Start accepts. Automaton has 20361 states and 78426 transitions. Word has length 40 [2019-12-28 03:47:07,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:07,055 INFO L462 AbstractCegarLoop]: Abstraction has 20361 states and 78426 transitions. [2019-12-28 03:47:07,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:07,056 INFO L276 IsEmpty]: Start isEmpty. Operand 20361 states and 78426 transitions. [2019-12-28 03:47:07,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-28 03:47:07,076 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:07,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:07,077 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:07,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:07,077 INFO L82 PathProgramCache]: Analyzing trace with hash -243116780, now seen corresponding path program 1 times [2019-12-28 03:47:07,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:07,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306203872] [2019-12-28 03:47:07,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:07,256 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-28 03:47:07,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306203872] [2019-12-28 03:47:07,257 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:07,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:07,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1457967280] [2019-12-28 03:47:07,257 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:07,267 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:07,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 48 transitions. [2019-12-28 03:47:07,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:07,273 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:07,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:07,276 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:07,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:07,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:07,276 INFO L87 Difference]: Start difference. First operand 20361 states and 78426 transitions. Second operand 5 states. [2019-12-28 03:47:08,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:08,340 INFO L93 Difference]: Finished difference Result 31839 states and 116043 transitions. [2019-12-28 03:47:08,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:08,340 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-28 03:47:08,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:08,483 INFO L225 Difference]: With dead ends: 31839 [2019-12-28 03:47:08,483 INFO L226 Difference]: Without dead ends: 31287 [2019-12-28 03:47:08,484 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-28 03:47:09,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31287 states. [2019-12-28 03:47:10,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31287 to 29706. [2019-12-28 03:47:10,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29706 states. [2019-12-28 03:47:10,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29706 states to 29706 states and 109520 transitions. [2019-12-28 03:47:10,712 INFO L78 Accepts]: Start accepts. Automaton has 29706 states and 109520 transitions. Word has length 48 [2019-12-28 03:47:10,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:10,714 INFO L462 AbstractCegarLoop]: Abstraction has 29706 states and 109520 transitions. [2019-12-28 03:47:10,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:10,715 INFO L276 IsEmpty]: Start isEmpty. Operand 29706 states and 109520 transitions. [2019-12-28 03:47:10,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-28 03:47:10,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:10,722 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-28 03:47:10,722 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:10,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:10,723 INFO L82 PathProgramCache]: Analyzing trace with hash -679798597, now seen corresponding path program 1 times [2019-12-28 03:47:10,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:10,724 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601146392] [2019-12-28 03:47:10,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:10,867 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-28 03:47:10,867 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601146392] [2019-12-28 03:47:10,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:10,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:10,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [908900725] [2019-12-28 03:47:10,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:10,874 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:10,883 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 121 transitions. [2019-12-28 03:47:10,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:10,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:10,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:10,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:10,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:10,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:10,888 INFO L87 Difference]: Start difference. First operand 29706 states and 109520 transitions. Second operand 5 states. [2019-12-28 03:47:11,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:11,430 INFO L93 Difference]: Finished difference Result 38697 states and 139692 transitions. [2019-12-28 03:47:11,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:11,430 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-28 03:47:11,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:11,547 INFO L225 Difference]: With dead ends: 38697 [2019-12-28 03:47:11,548 INFO L226 Difference]: Without dead ends: 38249 [2019-12-28 03:47:11,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-28 03:47:12,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38249 states. [2019-12-28 03:47:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38249 to 32952. [2019-12-28 03:47:12,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32952 states. [2019-12-28 03:47:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32952 states to 32952 states and 120529 transitions. [2019-12-28 03:47:14,789 INFO L78 Accepts]: Start accepts. Automaton has 32952 states and 120529 transitions. Word has length 49 [2019-12-28 03:47:14,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:14,790 INFO L462 AbstractCegarLoop]: Abstraction has 32952 states and 120529 transitions. [2019-12-28 03:47:14,793 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:14,793 INFO L276 IsEmpty]: Start isEmpty. Operand 32952 states and 120529 transitions. [2019-12-28 03:47:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-28 03:47:14,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:14,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:14,807 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:14,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:14,808 INFO L82 PathProgramCache]: Analyzing trace with hash 360461205, now seen corresponding path program 1 times [2019-12-28 03:47:14,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:14,809 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559232469] [2019-12-28 03:47:14,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:14,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:14,868 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-28 03:47:14,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559232469] [2019-12-28 03:47:14,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:14,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:47:14,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1953911040] [2019-12-28 03:47:14,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:14,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:14,888 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 96 states and 139 transitions. [2019-12-28 03:47:14,888 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:14,889 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:14,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:47:14,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:14,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:47:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:47:14,891 INFO L87 Difference]: Start difference. First operand 32952 states and 120529 transitions. Second operand 3 states. [2019-12-28 03:47:15,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:15,124 INFO L93 Difference]: Finished difference Result 42413 states and 152020 transitions. [2019-12-28 03:47:15,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:47:15,124 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-28 03:47:15,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:15,253 INFO L225 Difference]: With dead ends: 42413 [2019-12-28 03:47:15,253 INFO L226 Difference]: Without dead ends: 42413 [2019-12-28 03:47:15,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-28 03:47:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42413 states. [2019-12-28 03:47:16,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42413 to 37666. [2019-12-28 03:47:16,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37666 states. [2019-12-28 03:47:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37666 states to 37666 states and 136333 transitions. [2019-12-28 03:47:16,437 INFO L78 Accepts]: Start accepts. Automaton has 37666 states and 136333 transitions. Word has length 51 [2019-12-28 03:47:16,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:16,437 INFO L462 AbstractCegarLoop]: Abstraction has 37666 states and 136333 transitions. [2019-12-28 03:47:16,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:47:16,437 INFO L276 IsEmpty]: Start isEmpty. Operand 37666 states and 136333 transitions. [2019-12-28 03:47:16,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:16,453 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:16,454 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] [2019-12-28 03:47:16,454 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:16,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:16,454 INFO L82 PathProgramCache]: Analyzing trace with hash -1864507342, now seen corresponding path program 1 times [2019-12-28 03:47:16,455 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:16,455 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182462766] [2019-12-28 03:47:16,455 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:16,537 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-28 03:47:16,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182462766] [2019-12-28 03:47:16,537 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:16,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:16,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2077402046] [2019-12-28 03:47:16,538 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:16,547 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:16,564 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 116 states and 175 transitions. [2019-12-28 03:47:16,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:16,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:47:16,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:16,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:16,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:16,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:16,656 INFO L87 Difference]: Start difference. First operand 37666 states and 136333 transitions. Second operand 8 states. [2019-12-28 03:47:17,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:17,781 INFO L93 Difference]: Finished difference Result 48757 states and 172982 transitions. [2019-12-28 03:47:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:47:17,782 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 55 [2019-12-28 03:47:17,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:18,005 INFO L225 Difference]: With dead ends: 48757 [2019-12-28 03:47:18,005 INFO L226 Difference]: Without dead ends: 48237 [2019-12-28 03:47:18,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:47:18,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48237 states. [2019-12-28 03:47:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48237 to 38230. [2019-12-28 03:47:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38230 states. [2019-12-28 03:47:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38230 states to 38230 states and 138496 transitions. [2019-12-28 03:47:20,956 INFO L78 Accepts]: Start accepts. Automaton has 38230 states and 138496 transitions. Word has length 55 [2019-12-28 03:47:20,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:20,956 INFO L462 AbstractCegarLoop]: Abstraction has 38230 states and 138496 transitions. [2019-12-28 03:47:20,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:20,956 INFO L276 IsEmpty]: Start isEmpty. Operand 38230 states and 138496 transitions. [2019-12-28 03:47:20,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:20,973 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:20,973 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:20,973 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:20,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:20,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2007106397, now seen corresponding path program 1 times [2019-12-28 03:47:20,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:20,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971471048] [2019-12-28 03:47:20,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:21,110 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:21,110 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971471048] [2019-12-28 03:47:21,111 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:21,111 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:21,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1801334612] [2019-12-28 03:47:21,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:21,120 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:21,132 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:21,132 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:21,133 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:21,133 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:21,134 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:21,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:21,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:21,134 INFO L87 Difference]: Start difference. First operand 38230 states and 138496 transitions. Second operand 6 states. [2019-12-28 03:47:21,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:21,902 INFO L93 Difference]: Finished difference Result 53006 states and 189572 transitions. [2019-12-28 03:47:21,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:21,903 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-28 03:47:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:22,033 INFO L225 Difference]: With dead ends: 53006 [2019-12-28 03:47:22,033 INFO L226 Difference]: Without dead ends: 52030 [2019-12-28 03:47:22,034 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-28 03:47:22,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52030 states. [2019-12-28 03:47:23,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52030 to 48783. [2019-12-28 03:47:23,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48783 states. [2019-12-28 03:47:23,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48783 states to 48783 states and 175227 transitions. [2019-12-28 03:47:23,233 INFO L78 Accepts]: Start accepts. Automaton has 48783 states and 175227 transitions. Word has length 55 [2019-12-28 03:47:23,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:23,234 INFO L462 AbstractCegarLoop]: Abstraction has 48783 states and 175227 transitions. [2019-12-28 03:47:23,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:23,234 INFO L276 IsEmpty]: Start isEmpty. Operand 48783 states and 175227 transitions. [2019-12-28 03:47:23,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:23,252 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:23,252 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] [2019-12-28 03:47:23,252 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:23,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:23,253 INFO L82 PathProgramCache]: Analyzing trace with hash 490909540, now seen corresponding path program 1 times [2019-12-28 03:47:23,253 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:23,254 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642986467] [2019-12-28 03:47:23,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:23,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:23,374 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-28 03:47:23,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642986467] [2019-12-28 03:47:23,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:23,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:23,376 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [689438625] [2019-12-28 03:47:23,376 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:23,387 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:23,397 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:23,397 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:23,398 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:23,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:23,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:23,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:23,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:23,400 INFO L87 Difference]: Start difference. First operand 48783 states and 175227 transitions. Second operand 7 states. [2019-12-28 03:47:25,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:25,052 INFO L93 Difference]: Finished difference Result 70898 states and 244524 transitions. [2019-12-28 03:47:25,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:47:25,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-28 03:47:25,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:25,202 INFO L225 Difference]: With dead ends: 70898 [2019-12-28 03:47:25,202 INFO L226 Difference]: Without dead ends: 70898 [2019-12-28 03:47:25,202 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-28 03:47:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70898 states. [2019-12-28 03:47:28,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70898 to 57891. [2019-12-28 03:47:28,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57891 states. [2019-12-28 03:47:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57891 states to 57891 states and 203151 transitions. [2019-12-28 03:47:28,219 INFO L78 Accepts]: Start accepts. Automaton has 57891 states and 203151 transitions. Word has length 55 [2019-12-28 03:47:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:28,219 INFO L462 AbstractCegarLoop]: Abstraction has 57891 states and 203151 transitions. [2019-12-28 03:47:28,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 57891 states and 203151 transitions. [2019-12-28 03:47:28,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-28 03:47:28,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:28,233 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] [2019-12-28 03:47:28,233 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:28,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:28,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1378413221, now seen corresponding path program 1 times [2019-12-28 03:47:28,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:28,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195183294] [2019-12-28 03:47:28,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:28,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:28,309 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-28 03:47:28,309 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195183294] [2019-12-28 03:47:28,310 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:28,310 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:28,310 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [665825778] [2019-12-28 03:47:28,310 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:28,317 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:28,323 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 58 states and 59 transitions. [2019-12-28 03:47:28,323 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:28,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:28,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:28,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:28,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:28,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:28,330 INFO L87 Difference]: Start difference. First operand 57891 states and 203151 transitions. Second operand 4 states. [2019-12-28 03:47:28,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:28,402 INFO L93 Difference]: Finished difference Result 10861 states and 33396 transitions. [2019-12-28 03:47:28,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:28,403 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-28 03:47:28,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:28,418 INFO L225 Difference]: With dead ends: 10861 [2019-12-28 03:47:28,418 INFO L226 Difference]: Without dead ends: 9362 [2019-12-28 03:47:28,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 03:47:28,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9362 states. [2019-12-28 03:47:28,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9362 to 9314. [2019-12-28 03:47:28,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9314 states. [2019-12-28 03:47:28,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9314 states to 9314 states and 28346 transitions. [2019-12-28 03:47:28,532 INFO L78 Accepts]: Start accepts. Automaton has 9314 states and 28346 transitions. Word has length 55 [2019-12-28 03:47:28,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:28,532 INFO L462 AbstractCegarLoop]: Abstraction has 9314 states and 28346 transitions. [2019-12-28 03:47:28,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:28,533 INFO L276 IsEmpty]: Start isEmpty. Operand 9314 states and 28346 transitions. [2019-12-28 03:47:28,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:47:28,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:28,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:28,537 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:28,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:28,538 INFO L82 PathProgramCache]: Analyzing trace with hash 210347587, now seen corresponding path program 1 times [2019-12-28 03:47:28,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:28,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232869336] [2019-12-28 03:47:28,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:28,602 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-28 03:47:28,602 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232869336] [2019-12-28 03:47:28,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:28,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:28,603 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1505759420] [2019-12-28 03:47:28,603 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:28,612 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:28,640 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:47:28,640 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:28,641 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:28,642 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:28,642 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:28,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:28,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:28,642 INFO L87 Difference]: Start difference. First operand 9314 states and 28346 transitions. Second operand 4 states. [2019-12-28 03:47:28,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:28,792 INFO L93 Difference]: Finished difference Result 10889 states and 33038 transitions. [2019-12-28 03:47:28,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:28,792 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-28 03:47:28,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:28,808 INFO L225 Difference]: With dead ends: 10889 [2019-12-28 03:47:28,808 INFO L226 Difference]: Without dead ends: 10889 [2019-12-28 03:47:28,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-28 03:47:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10889 states. [2019-12-28 03:47:28,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10889 to 9881. [2019-12-28 03:47:28,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9881 states. [2019-12-28 03:47:28,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9881 states to 9881 states and 30017 transitions. [2019-12-28 03:47:28,938 INFO L78 Accepts]: Start accepts. Automaton has 9881 states and 30017 transitions. Word has length 65 [2019-12-28 03:47:28,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:28,938 INFO L462 AbstractCegarLoop]: Abstraction has 9881 states and 30017 transitions. [2019-12-28 03:47:28,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 9881 states and 30017 transitions. [2019-12-28 03:47:28,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-28 03:47:28,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:28,946 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:28,946 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:28,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:28,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1953157922, now seen corresponding path program 1 times [2019-12-28 03:47:28,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:28,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954423152] [2019-12-28 03:47:28,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:28,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:29,025 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-28 03:47:29,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954423152] [2019-12-28 03:47:29,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:29,026 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:29,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1759058640] [2019-12-28 03:47:29,026 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:29,389 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:29,415 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 134 states and 201 transitions. [2019-12-28 03:47:29,415 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:29,416 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:29,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:29,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:29,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:29,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:29,417 INFO L87 Difference]: Start difference. First operand 9881 states and 30017 transitions. Second operand 6 states. [2019-12-28 03:47:29,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:29,945 INFO L93 Difference]: Finished difference Result 12787 states and 38227 transitions. [2019-12-28 03:47:29,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:47:29,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-28 03:47:29,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:29,965 INFO L225 Difference]: With dead ends: 12787 [2019-12-28 03:47:29,965 INFO L226 Difference]: Without dead ends: 12739 [2019-12-28 03:47:29,966 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-28 03:47:29,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12739 states. [2019-12-28 03:47:30,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12739 to 10620. [2019-12-28 03:47:30,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10620 states. [2019-12-28 03:47:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10620 states to 10620 states and 32070 transitions. [2019-12-28 03:47:30,114 INFO L78 Accepts]: Start accepts. Automaton has 10620 states and 32070 transitions. Word has length 65 [2019-12-28 03:47:30,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:30,115 INFO L462 AbstractCegarLoop]: Abstraction has 10620 states and 32070 transitions. [2019-12-28 03:47:30,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:30,115 INFO L276 IsEmpty]: Start isEmpty. Operand 10620 states and 32070 transitions. [2019-12-28 03:47:30,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:47:30,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:30,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:30,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:30,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:30,122 INFO L82 PathProgramCache]: Analyzing trace with hash 432491766, now seen corresponding path program 1 times [2019-12-28 03:47:30,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:30,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145301193] [2019-12-28 03:47:30,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:30,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:30,189 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-28 03:47:30,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145301193] [2019-12-28 03:47:30,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:30,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:30,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1216628422] [2019-12-28 03:47:30,191 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:30,203 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:30,216 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:47:30,217 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:30,217 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:30,217 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:30,218 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:30,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:30,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:30,218 INFO L87 Difference]: Start difference. First operand 10620 states and 32070 transitions. Second operand 4 states. [2019-12-28 03:47:30,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:30,462 INFO L93 Difference]: Finished difference Result 13322 states and 39672 transitions. [2019-12-28 03:47:30,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:47:30,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-28 03:47:30,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:30,483 INFO L225 Difference]: With dead ends: 13322 [2019-12-28 03:47:30,483 INFO L226 Difference]: Without dead ends: 13322 [2019-12-28 03:47:30,483 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-28 03:47:30,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13322 states. [2019-12-28 03:47:30,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13322 to 12176. [2019-12-28 03:47:30,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12176 states. [2019-12-28 03:47:30,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12176 states to 12176 states and 36361 transitions. [2019-12-28 03:47:30,642 INFO L78 Accepts]: Start accepts. Automaton has 12176 states and 36361 transitions. Word has length 67 [2019-12-28 03:47:30,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:30,642 INFO L462 AbstractCegarLoop]: Abstraction has 12176 states and 36361 transitions. [2019-12-28 03:47:30,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:30,643 INFO L276 IsEmpty]: Start isEmpty. Operand 12176 states and 36361 transitions. [2019-12-28 03:47:30,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:47:30,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:30,652 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:30,652 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:30,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:30,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1644717577, now seen corresponding path program 1 times [2019-12-28 03:47:30,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:30,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302118965] [2019-12-28 03:47:30,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:30,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:30,691 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-28 03:47:30,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302118965] [2019-12-28 03:47:30,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:30,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:47:30,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [354747981] [2019-12-28 03:47:30,692 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:30,702 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:30,714 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 68 states and 67 transitions. [2019-12-28 03:47:30,715 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:30,715 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:30,715 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:47:30,716 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:30,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:47:30,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:47:30,716 INFO L87 Difference]: Start difference. First operand 12176 states and 36361 transitions. Second operand 3 states. [2019-12-28 03:47:30,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:30,906 INFO L93 Difference]: Finished difference Result 12702 states and 37766 transitions. [2019-12-28 03:47:30,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:47:30,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-28 03:47:30,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:30,923 INFO L225 Difference]: With dead ends: 12702 [2019-12-28 03:47:30,924 INFO L226 Difference]: Without dead ends: 12702 [2019-12-28 03:47:30,924 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-28 03:47:30,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12702 states. [2019-12-28 03:47:31,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12702 to 12464. [2019-12-28 03:47:31,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12464 states. [2019-12-28 03:47:31,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12464 states to 12464 states and 37125 transitions. [2019-12-28 03:47:31,076 INFO L78 Accepts]: Start accepts. Automaton has 12464 states and 37125 transitions. Word has length 67 [2019-12-28 03:47:31,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:31,077 INFO L462 AbstractCegarLoop]: Abstraction has 12464 states and 37125 transitions. [2019-12-28 03:47:31,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:47:31,077 INFO L276 IsEmpty]: Start isEmpty. Operand 12464 states and 37125 transitions. [2019-12-28 03:47:31,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:31,087 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:31,088 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:31,088 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:31,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:31,088 INFO L82 PathProgramCache]: Analyzing trace with hash 823928763, now seen corresponding path program 1 times [2019-12-28 03:47:31,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:31,089 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118045886] [2019-12-28 03:47:31,089 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:31,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:31,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:31,164 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118045886] [2019-12-28 03:47:31,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:31,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:31,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [267611711] [2019-12-28 03:47:31,165 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:31,176 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:31,189 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:31,189 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:31,190 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:31,190 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:31,190 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:31,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:31,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:31,191 INFO L87 Difference]: Start difference. First operand 12464 states and 37125 transitions. Second operand 6 states. [2019-12-28 03:47:32,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:32,229 INFO L93 Difference]: Finished difference Result 23174 states and 68856 transitions. [2019-12-28 03:47:32,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:47:32,229 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:47:32,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:32,260 INFO L225 Difference]: With dead ends: 23174 [2019-12-28 03:47:32,260 INFO L226 Difference]: Without dead ends: 23174 [2019-12-28 03:47:32,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:32,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23174 states. [2019-12-28 03:47:32,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23174 to 16076. [2019-12-28 03:47:32,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16076 states. [2019-12-28 03:47:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16076 states to 16076 states and 47615 transitions. [2019-12-28 03:47:32,504 INFO L78 Accepts]: Start accepts. Automaton has 16076 states and 47615 transitions. Word has length 69 [2019-12-28 03:47:32,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:32,505 INFO L462 AbstractCegarLoop]: Abstraction has 16076 states and 47615 transitions. [2019-12-28 03:47:32,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:32,505 INFO L276 IsEmpty]: Start isEmpty. Operand 16076 states and 47615 transitions. [2019-12-28 03:47:32,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:32,520 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:32,520 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:32,521 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:32,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:32,521 INFO L82 PathProgramCache]: Analyzing trace with hash 313394586, now seen corresponding path program 1 times [2019-12-28 03:47:32,521 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:32,522 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135712666] [2019-12-28 03:47:32,522 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:32,617 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135712666] [2019-12-28 03:47:32,617 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:32,618 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:32,618 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774518303] [2019-12-28 03:47:32,618 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:32,629 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:32,643 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:32,643 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:32,643 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:32,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:32,644 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:32,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:32,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:32,644 INFO L87 Difference]: Start difference. First operand 16076 states and 47615 transitions. Second operand 6 states. [2019-12-28 03:47:33,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:33,239 INFO L93 Difference]: Finished difference Result 16312 states and 48080 transitions. [2019-12-28 03:47:33,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:33,239 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:47:33,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:33,261 INFO L225 Difference]: With dead ends: 16312 [2019-12-28 03:47:33,262 INFO L226 Difference]: Without dead ends: 16312 [2019-12-28 03:47:33,262 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-28 03:47:33,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16312 states. [2019-12-28 03:47:33,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16312 to 15788. [2019-12-28 03:47:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15788 states. [2019-12-28 03:47:33,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15788 states to 15788 states and 46696 transitions. [2019-12-28 03:47:33,469 INFO L78 Accepts]: Start accepts. Automaton has 15788 states and 46696 transitions. Word has length 69 [2019-12-28 03:47:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:33,469 INFO L462 AbstractCegarLoop]: Abstraction has 15788 states and 46696 transitions. [2019-12-28 03:47:33,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:33,470 INFO L276 IsEmpty]: Start isEmpty. Operand 15788 states and 46696 transitions. [2019-12-28 03:47:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:33,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:33,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:33,482 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:33,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:33,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1253280580, now seen corresponding path program 1 times [2019-12-28 03:47:33,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:33,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790849402] [2019-12-28 03:47:33,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:33,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:33,546 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-28 03:47:33,547 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790849402] [2019-12-28 03:47:33,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:33,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:33,548 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1810156353] [2019-12-28 03:47:33,548 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:33,558 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:33,572 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:33,572 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:33,573 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:33,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:33,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:33,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:33,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:33,574 INFO L87 Difference]: Start difference. First operand 15788 states and 46696 transitions. Second operand 5 states. [2019-12-28 03:47:33,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:33,904 INFO L93 Difference]: Finished difference Result 20228 states and 59547 transitions. [2019-12-28 03:47:33,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:47:33,905 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:33,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:33,933 INFO L225 Difference]: With dead ends: 20228 [2019-12-28 03:47:33,933 INFO L226 Difference]: Without dead ends: 20228 [2019-12-28 03:47:33,934 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:33,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20228 states. [2019-12-28 03:47:34,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20228 to 15792. [2019-12-28 03:47:34,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15792 states. [2019-12-28 03:47:34,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15792 states to 15792 states and 46227 transitions. [2019-12-28 03:47:34,513 INFO L78 Accepts]: Start accepts. Automaton has 15792 states and 46227 transitions. Word has length 69 [2019-12-28 03:47:34,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:34,514 INFO L462 AbstractCegarLoop]: Abstraction has 15792 states and 46227 transitions. [2019-12-28 03:47:34,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:34,514 INFO L276 IsEmpty]: Start isEmpty. Operand 15792 states and 46227 transitions. [2019-12-28 03:47:34,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:34,527 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:34,527 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:34,527 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:34,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:34,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1763814757, now seen corresponding path program 1 times [2019-12-28 03:47:34,528 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:34,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171742429] [2019-12-28 03:47:34,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:34,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:34,605 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-28 03:47:34,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171742429] [2019-12-28 03:47:34,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:34,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:34,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2072533706] [2019-12-28 03:47:34,606 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:34,617 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:34,631 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:34,631 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:34,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:34,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:34,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:34,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:34,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:34,632 INFO L87 Difference]: Start difference. First operand 15792 states and 46227 transitions. Second operand 5 states. [2019-12-28 03:47:35,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:35,080 INFO L93 Difference]: Finished difference Result 20568 states and 59927 transitions. [2019-12-28 03:47:35,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:47:35,081 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:35,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:35,109 INFO L225 Difference]: With dead ends: 20568 [2019-12-28 03:47:35,109 INFO L226 Difference]: Without dead ends: 20568 [2019-12-28 03:47:35,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20568 states. [2019-12-28 03:47:35,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20568 to 16697. [2019-12-28 03:47:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16697 states. [2019-12-28 03:47:35,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16697 states to 16697 states and 48872 transitions. [2019-12-28 03:47:35,345 INFO L78 Accepts]: Start accepts. Automaton has 16697 states and 48872 transitions. Word has length 69 [2019-12-28 03:47:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:35,345 INFO L462 AbstractCegarLoop]: Abstraction has 16697 states and 48872 transitions. [2019-12-28 03:47:35,345 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16697 states and 48872 transitions. [2019-12-28 03:47:35,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:35,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:35,355 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:35,355 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:35,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:35,356 INFO L82 PathProgramCache]: Analyzing trace with hash 723698076, now seen corresponding path program 1 times [2019-12-28 03:47:35,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:35,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448784143] [2019-12-28 03:47:35,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:35,421 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-28 03:47:35,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448784143] [2019-12-28 03:47:35,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:35,422 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:47:35,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1946484297] [2019-12-28 03:47:35,423 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:35,433 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:35,446 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:35,447 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:35,447 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:35,447 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:47:35,448 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:35,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:47:35,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:47:35,448 INFO L87 Difference]: Start difference. First operand 16697 states and 48872 transitions. Second operand 4 states. [2019-12-28 03:47:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:35,983 INFO L93 Difference]: Finished difference Result 21470 states and 62923 transitions. [2019-12-28 03:47:35,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:47:35,984 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-28 03:47:35,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:36,013 INFO L225 Difference]: With dead ends: 21470 [2019-12-28 03:47:36,014 INFO L226 Difference]: Without dead ends: 21206 [2019-12-28 03:47:36,014 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-28 03:47:36,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21206 states. [2019-12-28 03:47:36,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21206 to 19805. [2019-12-28 03:47:36,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19805 states. [2019-12-28 03:47:36,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19805 states to 19805 states and 58090 transitions. [2019-12-28 03:47:36,271 INFO L78 Accepts]: Start accepts. Automaton has 19805 states and 58090 transitions. Word has length 69 [2019-12-28 03:47:36,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:36,271 INFO L462 AbstractCegarLoop]: Abstraction has 19805 states and 58090 transitions. [2019-12-28 03:47:36,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:47:36,272 INFO L276 IsEmpty]: Start isEmpty. Operand 19805 states and 58090 transitions. [2019-12-28 03:47:36,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:36,283 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:36,283 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:36,283 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1073253283, now seen corresponding path program 1 times [2019-12-28 03:47:36,284 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:36,285 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161869831] [2019-12-28 03:47:36,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:36,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:36,420 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-28 03:47:36,421 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161869831] [2019-12-28 03:47:36,421 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:36,421 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:36,421 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [108872795] [2019-12-28 03:47:36,421 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:36,428 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:36,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:36,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:36,438 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:36,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:36,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:36,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:36,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:36,439 INFO L87 Difference]: Start difference. First operand 19805 states and 58090 transitions. Second operand 7 states. [2019-12-28 03:47:37,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:37,209 INFO L93 Difference]: Finished difference Result 18762 states and 52474 transitions. [2019-12-28 03:47:37,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:47:37,210 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 03:47:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:37,234 INFO L225 Difference]: With dead ends: 18762 [2019-12-28 03:47:37,235 INFO L226 Difference]: Without dead ends: 18762 [2019-12-28 03:47:37,235 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-28 03:47:37,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18762 states. [2019-12-28 03:47:37,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18762 to 12328. [2019-12-28 03:47:37,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12328 states. [2019-12-28 03:47:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12328 states to 12328 states and 34556 transitions. [2019-12-28 03:47:37,443 INFO L78 Accepts]: Start accepts. Automaton has 12328 states and 34556 transitions. Word has length 69 [2019-12-28 03:47:37,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:37,443 INFO L462 AbstractCegarLoop]: Abstraction has 12328 states and 34556 transitions. [2019-12-28 03:47:37,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:37,443 INFO L276 IsEmpty]: Start isEmpty. Operand 12328 states and 34556 transitions. [2019-12-28 03:47:37,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:47:37,452 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:37,453 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:37,453 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:37,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:37,453 INFO L82 PathProgramCache]: Analyzing trace with hash -185749602, now seen corresponding path program 1 times [2019-12-28 03:47:37,454 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:37,454 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846021041] [2019-12-28 03:47:37,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:37,511 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-28 03:47:37,512 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846021041] [2019-12-28 03:47:37,512 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:37,512 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:37,512 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [605085734] [2019-12-28 03:47:37,512 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:37,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:37,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 70 states and 69 transitions. [2019-12-28 03:47:37,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:37,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:47:37,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:47:37,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:37,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:47:37,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:47:37,537 INFO L87 Difference]: Start difference. First operand 12328 states and 34556 transitions. Second operand 5 states. [2019-12-28 03:47:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:37,628 INFO L93 Difference]: Finished difference Result 3895 states and 9407 transitions. [2019-12-28 03:47:37,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:47:37,628 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:47:37,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:37,633 INFO L225 Difference]: With dead ends: 3895 [2019-12-28 03:47:37,633 INFO L226 Difference]: Without dead ends: 3216 [2019-12-28 03:47:37,633 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-28 03:47:37,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3216 states. [2019-12-28 03:47:37,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3216 to 2984. [2019-12-28 03:47:37,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2984 states. [2019-12-28 03:47:37,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2984 states to 2984 states and 7116 transitions. [2019-12-28 03:47:37,675 INFO L78 Accepts]: Start accepts. Automaton has 2984 states and 7116 transitions. Word has length 69 [2019-12-28 03:47:37,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:37,675 INFO L462 AbstractCegarLoop]: Abstraction has 2984 states and 7116 transitions. [2019-12-28 03:47:37,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:47:37,675 INFO L276 IsEmpty]: Start isEmpty. Operand 2984 states and 7116 transitions. [2019-12-28 03:47:37,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:37,679 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:37,679 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:47:37,680 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:37,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:37,680 INFO L82 PathProgramCache]: Analyzing trace with hash -529521906, now seen corresponding path program 1 times [2019-12-28 03:47:37,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:37,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642175494] [2019-12-28 03:47:37,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:37,843 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-28 03:47:37,843 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642175494] [2019-12-28 03:47:37,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:37,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:37,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1774765307] [2019-12-28 03:47:37,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:37,868 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:37,950 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:37,950 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:37,976 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:47:37,978 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:47:37,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:37,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:47:37,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:47:37,979 INFO L87 Difference]: Start difference. First operand 2984 states and 7116 transitions. Second operand 8 states. [2019-12-28 03:47:38,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:38,956 INFO L93 Difference]: Finished difference Result 4084 states and 9526 transitions. [2019-12-28 03:47:38,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-28 03:47:38,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 86 [2019-12-28 03:47:38,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:38,962 INFO L225 Difference]: With dead ends: 4084 [2019-12-28 03:47:38,962 INFO L226 Difference]: Without dead ends: 4048 [2019-12-28 03:47:38,963 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=257, Unknown=0, NotChecked=0, Total=342 [2019-12-28 03:47:38,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2019-12-28 03:47:38,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 3142. [2019-12-28 03:47:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3142 states. [2019-12-28 03:47:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3142 states to 3142 states and 7455 transitions. [2019-12-28 03:47:38,998 INFO L78 Accepts]: Start accepts. Automaton has 3142 states and 7455 transitions. Word has length 86 [2019-12-28 03:47:38,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:38,998 INFO L462 AbstractCegarLoop]: Abstraction has 3142 states and 7455 transitions. [2019-12-28 03:47:38,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:47:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3142 states and 7455 transitions. [2019-12-28 03:47:39,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:39,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:39,004 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] [2019-12-28 03:47:39,004 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:39,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:39,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1688236047, now seen corresponding path program 1 times [2019-12-28 03:47:39,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:39,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396223205] [2019-12-28 03:47:39,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:39,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:39,144 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-28 03:47:39,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396223205] [2019-12-28 03:47:39,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:39,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:47:39,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [127325565] [2019-12-28 03:47:39,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:39,164 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:39,250 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 191 states and 284 transitions. [2019-12-28 03:47:39,250 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:39,302 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-28 03:47:39,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:47:39,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:39,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:47:39,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:47:39,305 INFO L87 Difference]: Start difference. First operand 3142 states and 7455 transitions. Second operand 9 states. [2019-12-28 03:47:39,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:39,782 INFO L93 Difference]: Finished difference Result 6069 states and 14520 transitions. [2019-12-28 03:47:39,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:47:39,783 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 86 [2019-12-28 03:47:39,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:39,793 INFO L225 Difference]: With dead ends: 6069 [2019-12-28 03:47:39,794 INFO L226 Difference]: Without dead ends: 5239 [2019-12-28 03:47:39,794 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-12-28 03:47:39,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5239 states. [2019-12-28 03:47:39,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5239 to 3400. [2019-12-28 03:47:39,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3400 states. [2019-12-28 03:47:39,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 8134 transitions. [2019-12-28 03:47:39,881 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 8134 transitions. Word has length 86 [2019-12-28 03:47:39,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:39,881 INFO L462 AbstractCegarLoop]: Abstraction has 3400 states and 8134 transitions. [2019-12-28 03:47:39,881 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:47:39,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 8134 transitions. [2019-12-28 03:47:39,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:39,888 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:39,889 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] [2019-12-28 03:47:39,889 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:39,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:39,889 INFO L82 PathProgramCache]: Analyzing trace with hash 766194047, now seen corresponding path program 2 times [2019-12-28 03:47:39,890 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:39,890 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066939661] [2019-12-28 03:47:39,890 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:39,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:40,076 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-28 03:47:40,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066939661] [2019-12-28 03:47:40,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:40,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:47:40,078 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1918092599] [2019-12-28 03:47:40,078 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:40,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:40,432 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 172 states and 254 transitions. [2019-12-28 03:47:40,432 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:40,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-28 03:47:40,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 03:47:40,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:40,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 03:47:40,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:47:40,568 INFO L87 Difference]: Start difference. First operand 3400 states and 8134 transitions. Second operand 13 states. [2019-12-28 03:47:44,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:44,972 INFO L93 Difference]: Finished difference Result 12811 states and 30215 transitions. [2019-12-28 03:47:44,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-28 03:47:44,972 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-28 03:47:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:44,984 INFO L225 Difference]: With dead ends: 12811 [2019-12-28 03:47:44,984 INFO L226 Difference]: Without dead ends: 9414 [2019-12-28 03:47:44,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=295, Invalid=1187, Unknown=0, NotChecked=0, Total=1482 [2019-12-28 03:47:44,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9414 states. [2019-12-28 03:47:45,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9414 to 3794. [2019-12-28 03:47:45,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3794 states. [2019-12-28 03:47:45,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3794 states to 3794 states and 8917 transitions. [2019-12-28 03:47:45,051 INFO L78 Accepts]: Start accepts. Automaton has 3794 states and 8917 transitions. Word has length 86 [2019-12-28 03:47:45,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:45,051 INFO L462 AbstractCegarLoop]: Abstraction has 3794 states and 8917 transitions. [2019-12-28 03:47:45,051 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 03:47:45,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3794 states and 8917 transitions. [2019-12-28 03:47:45,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:45,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:45,055 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] [2019-12-28 03:47:45,055 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:45,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:45,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1023314086, now seen corresponding path program 1 times [2019-12-28 03:47:45,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:45,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569444648] [2019-12-28 03:47:45,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:45,188 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-28 03:47:45,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569444648] [2019-12-28 03:47:45,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:45,189 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:47:45,189 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [29736398] [2019-12-28 03:47:45,189 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:45,207 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:45,284 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 183 states and 275 transitions. [2019-12-28 03:47:45,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:45,342 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-28 03:47:45,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:47:45,388 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-28 03:47:45,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:45,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-28 03:47:45,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:47:45,389 INFO L87 Difference]: Start difference. First operand 3794 states and 8917 transitions. Second operand 13 states. [2019-12-28 03:47:46,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:46,033 INFO L93 Difference]: Finished difference Result 8266 states and 19422 transitions. [2019-12-28 03:47:46,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 03:47:46,034 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 86 [2019-12-28 03:47:46,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:46,039 INFO L225 Difference]: With dead ends: 8266 [2019-12-28 03:47:46,039 INFO L226 Difference]: Without dead ends: 4220 [2019-12-28 03:47:46,040 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=399, Unknown=0, NotChecked=0, Total=600 [2019-12-28 03:47:46,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4220 states. [2019-12-28 03:47:46,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4220 to 2257. [2019-12-28 03:47:46,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2257 states. [2019-12-28 03:47:46,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 5324 transitions. [2019-12-28 03:47:46,073 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 5324 transitions. Word has length 86 [2019-12-28 03:47:46,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:46,073 INFO L462 AbstractCegarLoop]: Abstraction has 2257 states and 5324 transitions. [2019-12-28 03:47:46,073 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-28 03:47:46,073 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 5324 transitions. [2019-12-28 03:47:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:46,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:46,075 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] [2019-12-28 03:47:46,075 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:46,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:46,076 INFO L82 PathProgramCache]: Analyzing trace with hash -1306645324, now seen corresponding path program 1 times [2019-12-28 03:47:46,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:46,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981891207] [2019-12-28 03:47:46,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:46,145 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-28 03:47:46,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981891207] [2019-12-28 03:47:46,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:46,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:47:46,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1200556783] [2019-12-28 03:47:46,146 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:46,160 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:46,221 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 03:47:46,221 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:46,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:47:46,264 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:47:46,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:46,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:47:46,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:47:46,265 INFO L87 Difference]: Start difference. First operand 2257 states and 5324 transitions. Second operand 7 states. [2019-12-28 03:47:47,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:47,252 INFO L93 Difference]: Finished difference Result 3269 states and 7392 transitions. [2019-12-28 03:47:47,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:47:47,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-12-28 03:47:47,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:47,258 INFO L225 Difference]: With dead ends: 3269 [2019-12-28 03:47:47,258 INFO L226 Difference]: Without dead ends: 3247 [2019-12-28 03:47:47,258 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-28 03:47:47,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3247 states. [2019-12-28 03:47:47,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3247 to 2275. [2019-12-28 03:47:47,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2275 states. [2019-12-28 03:47:47,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2275 states to 2275 states and 5197 transitions. [2019-12-28 03:47:47,284 INFO L78 Accepts]: Start accepts. Automaton has 2275 states and 5197 transitions. Word has length 86 [2019-12-28 03:47:47,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:47,284 INFO L462 AbstractCegarLoop]: Abstraction has 2275 states and 5197 transitions. [2019-12-28 03:47:47,285 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:47:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2275 states and 5197 transitions. [2019-12-28 03:47:47,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:47,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:47,287 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] [2019-12-28 03:47:47,287 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:47,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:47,287 INFO L82 PathProgramCache]: Analyzing trace with hash -613543627, now seen corresponding path program 1 times [2019-12-28 03:47:47,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:47,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023141664] [2019-12-28 03:47:47,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:47,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:47:47,383 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023141664] [2019-12-28 03:47:47,383 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:47,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:47:47,384 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1815143826] [2019-12-28 03:47:47,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:47,404 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:47,472 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 128 states and 168 transitions. [2019-12-28 03:47:47,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:47,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:47:47,475 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:47:47,475 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:47:47,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:47,475 INFO L87 Difference]: Start difference. First operand 2275 states and 5197 transitions. Second operand 6 states. [2019-12-28 03:47:47,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:47,810 INFO L93 Difference]: Finished difference Result 2472 states and 5635 transitions. [2019-12-28 03:47:47,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:47:47,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 86 [2019-12-28 03:47:47,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:47,813 INFO L225 Difference]: With dead ends: 2472 [2019-12-28 03:47:47,814 INFO L226 Difference]: Without dead ends: 2472 [2019-12-28 03:47:47,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:47:47,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2019-12-28 03:47:47,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 2217. [2019-12-28 03:47:47,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-28 03:47:47,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 5079 transitions. [2019-12-28 03:47:47,849 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 5079 transitions. Word has length 86 [2019-12-28 03:47:47,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:47,849 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 5079 transitions. [2019-12-28 03:47:47,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:47:47,849 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 5079 transitions. [2019-12-28 03:47:47,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:47,852 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:47,852 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] [2019-12-28 03:47:47,853 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:47,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:47,853 INFO L82 PathProgramCache]: Analyzing trace with hash 644452468, now seen corresponding path program 1 times [2019-12-28 03:47:47,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:47,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205068641] [2019-12-28 03:47:47,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:48,011 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-28 03:47:48,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205068641] [2019-12-28 03:47:48,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:48,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:47:48,012 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [519667973] [2019-12-28 03:47:48,012 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:48,028 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:48,089 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 03:47:48,089 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:48,172 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-28 03:47:48,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-28 03:47:48,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:48,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-28 03:47:48,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:47:48,173 INFO L87 Difference]: Start difference. First operand 2217 states and 5079 transitions. Second operand 11 states. [2019-12-28 03:47:49,342 WARN L192 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2019-12-28 03:47:49,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:49,994 INFO L93 Difference]: Finished difference Result 3084 states and 7005 transitions. [2019-12-28 03:47:49,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-28 03:47:49,994 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 86 [2019-12-28 03:47:49,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:49,998 INFO L225 Difference]: With dead ends: 3084 [2019-12-28 03:47:49,998 INFO L226 Difference]: Without dead ends: 3084 [2019-12-28 03:47:49,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2019-12-28 03:47:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2019-12-28 03:47:50,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 2224. [2019-12-28 03:47:50,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2019-12-28 03:47:50,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 5084 transitions. [2019-12-28 03:47:50,025 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 5084 transitions. Word has length 86 [2019-12-28 03:47:50,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:50,025 INFO L462 AbstractCegarLoop]: Abstraction has 2224 states and 5084 transitions. [2019-12-28 03:47:50,025 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-28 03:47:50,025 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 5084 transitions. [2019-12-28 03:47:50,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:50,027 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:50,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:47:50,028 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:50,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:50,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1531956149, now seen corresponding path program 3 times [2019-12-28 03:47:50,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:50,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37560228] [2019-12-28 03:47:50,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:50,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:47:50,193 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-28 03:47:50,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37560228] [2019-12-28 03:47:50,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:47:50,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-28 03:47:50,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [844263913] [2019-12-28 03:47:50,194 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:47:50,209 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:47:50,265 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 135 states and 182 transitions. [2019-12-28 03:47:50,266 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:47:50,267 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:47:50,267 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:47:50,267 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:47:50,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:47:50,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:47:50,268 INFO L87 Difference]: Start difference. First operand 2224 states and 5084 transitions. Second operand 10 states. [2019-12-28 03:47:50,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:47:50,589 INFO L93 Difference]: Finished difference Result 3725 states and 8480 transitions. [2019-12-28 03:47:50,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:47:50,590 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 86 [2019-12-28 03:47:50,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:47:50,593 INFO L225 Difference]: With dead ends: 3725 [2019-12-28 03:47:50,594 INFO L226 Difference]: Without dead ends: 2479 [2019-12-28 03:47:50,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:47:50,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2019-12-28 03:47:50,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2226. [2019-12-28 03:47:50,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2019-12-28 03:47:50,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 5085 transitions. [2019-12-28 03:47:50,615 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 5085 transitions. Word has length 86 [2019-12-28 03:47:50,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:47:50,615 INFO L462 AbstractCegarLoop]: Abstraction has 2226 states and 5085 transitions. [2019-12-28 03:47:50,615 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:47:50,615 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 5085 transitions. [2019-12-28 03:47:50,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-28 03:47:50,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:47:50,618 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] [2019-12-28 03:47:50,618 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:47:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:47:50,619 INFO L82 PathProgramCache]: Analyzing trace with hash 167637331, now seen corresponding path program 4 times [2019-12-28 03:47:50,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:47:50,620 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776640383] [2019-12-28 03:47:50,620 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:47:50,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:47:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:47:50,699 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:47:50,699 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:47:50,872 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:47:50 BasicIcfg [2019-12-28 03:47:50,872 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:47:50,874 INFO L168 Benchmark]: Toolchain (without parser) took 50152.91 ms. Allocated memory was 146.8 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 103.4 MB in the beginning and 652.4 MB in the end (delta: -549.1 MB). Peak memory consumption was 1.5 GB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,874 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-28 03:47:50,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 749.38 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 102.9 MB in the beginning and 154.8 MB in the end (delta: -51.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,875 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.13 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,876 INFO L168 Benchmark]: Boogie Preprocessor took 45.06 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,876 INFO L168 Benchmark]: RCFGBuilder took 708.03 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 108.6 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,877 INFO L168 Benchmark]: TraceAbstraction took 48584.63 ms. Allocated memory was 202.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 108.6 MB in the beginning and 652.4 MB in the end (delta: -543.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-28 03:47:50,879 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 146.8 MB. Free memory is still 122.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 749.38 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 102.9 MB in the beginning and 154.8 MB in the end (delta: -51.8 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.13 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.06 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 149.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 708.03 ms. Allocated memory is still 202.4 MB. Free memory was 149.9 MB in the beginning and 108.6 MB in the end (delta: 41.3 MB). Peak memory consumption was 41.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 48584.63 ms. Allocated memory was 202.4 MB in the beginning and 2.2 GB in the end (delta: 2.0 GB). Free memory was 108.6 MB in the beginning and 652.4 MB in the end (delta: -543.8 MB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L707] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L709] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L710] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L711] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L712] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L713] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L714] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L715] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L716] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L717] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L718] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L719] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L720] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L721] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L723] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L724] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L725] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L801] 0 pthread_t t1659; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L802] FCALL, FORK 0 pthread_create(&t1659, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L803] 0 pthread_t t1660; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1660, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L765] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L766] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = (_Bool)1 [L770] 2 z = 1 [L773] 2 __unbuffered_p1_EAX = z [L776] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L779] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L780] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L781] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L782] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L782] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L783] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L783] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L786] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L743] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] EXPR 1 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L746] 1 y = y$flush_delayed ? y$mem_tmp : y [L747] 1 y$flush_delayed = (_Bool)0 [L752] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L810] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L811] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L812] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L813] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L814] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L814] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L817] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 48.2s, OverallIterations: 28, TraceHistogramMax: 1, AutomataDifference: 22.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8012 SDtfs, 10762 SDslu, 23718 SDs, 0 SdLazy, 10722 SolverSat, 499 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 387 GetRequests, 120 SyntacticMatches, 15 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 589 ImplicationChecksByTransitivity, 4.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=57891occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.4s AutomataMinimizationTime, 27 MinimizatonAttempts, 79109 StatesRemovedByMinimization, 26 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1929 NumberOfCodeBlocks, 1929 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1816 ConstructedInterpolants, 0 QuantifiedInterpolants, 370522 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 27 InterpolantComputations, 27 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...